The programming logic PL/CV3 is based on the notion of a mathematical type. We present the core of the type theory, from which the full theory for program verification and specification can be derived. Whereas the full theory was designed to be useable, the core theory was selected to be analyzable. This presentation strives to be succinct yet thorough. The last section consists of examples, but the approach here is not tutorial. Key Words and phrases: automated logic, program verification, program specification, semantics of programming languages, type theory, foundations of mathematics
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We present three papers on the application of Martin-Löf's type theory to the analysis of programmin...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can ...
The design of a programming system is guided by certain beliefs, principles, and practical constrai...
Type theory has become central to computer science because it deals with fundamental issues in prog...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
There are compelling benefits to using foundational type theory as a framework for programming langu...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Types are an important part of any modern programming language, but we often forget that the concept...
Church’s type theory, aka simple type theory, is a formal logical language which includes classical ...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We present three papers on the application of Martin-Löf's type theory to the analysis of programmin...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can ...
The design of a programming system is guided by certain beliefs, principles, and practical constrai...
Type theory has become central to computer science because it deals with fundamental issues in prog...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
There are compelling benefits to using foundational type theory as a framework for programming langu...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Types are an important part of any modern programming language, but we often forget that the concept...
Church’s type theory, aka simple type theory, is a formal logical language which includes classical ...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We present three papers on the application of Martin-Löf's type theory to the analysis of programmin...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...