Add to ORKGPrograms are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop higher order logic and algorithmic (or programming or dynamic) logic in the theory. The theory described here is an evolution from de Bruijn's AUTOMATH and Martin-Lof's Intuitionistic Theory of Types
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
In this paper a hybrid type theory HTT is defined which combines the programming language notion of ...
The programming logic PL/CV3 is based on the notion of a mathematical type. We present the core of ...
Since 1970 several methods have been proposed for using formal systems of constructive logic as pro...
AbstractWe present the program development concept in a logical framework including constructive typ...
The design of a programming system is guided by certain beliefs, principles, and practical constrai...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
Systems built for automated program construction aim at the formalization of the programming process...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Type theory has become central to computer science because it deals with fundamental issues in prog...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
There exists an identifiable programming style based on the widespread use of type information handl...
AbstractThis paper describes a constructive system, based on a particular typed λ-calculus with cons...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
In this paper a hybrid type theory HTT is defined which combines the programming language notion of ...
The programming logic PL/CV3 is based on the notion of a mathematical type. We present the core of ...
Since 1970 several methods have been proposed for using formal systems of constructive logic as pro...
AbstractWe present the program development concept in a logical framework including constructive typ...
The design of a programming system is guided by certain beliefs, principles, and practical constrai...
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control...
In this chapter, we propose a framework for logic programming with different type systems. In this f...
Systems built for automated program construction aim at the formalization of the programming process...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Type theory has become central to computer science because it deals with fundamental issues in prog...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
There exists an identifiable programming style based on the widespread use of type information handl...
AbstractThis paper describes a constructive system, based on a particular typed λ-calculus with cons...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
In this paper a hybrid type theory HTT is defined which combines the programming language notion of ...