AbstractRecent developments in the area of expressive types have the prospect to supply the ordinary programmer with a programming language rich enough to verify complex program properties. Program verification is made possible via tractable type checking. We explore this possibility by considering two specific examples; verifying sortedness and resource usage verification. We show that advanced type error diagnosis methods become essential to assist the user in case of type checking failure. Our results point out new research directions for the development of programming environments in which users can write and verify their programs
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Dynamically typed languages languages are very well suited for rapid prototyping, agile programming ...
AbstractRecent developments in the area of expressive types have the prospect to supply the ordinary...
10.1016/j.entcs.2006.10.041Electronic Notes in Theoretical Computer Science1747129-14
Programming language implementations bridge the gap between what the program developer sees and unde...
Because of our increasing dependence on software in every aspect of our lives, it is crucial that ou...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Formal verification of real-world software systems remains challenging for a number of reasons, incl...
Language extensions introduce high-level programming constructs that protect programmers from low-le...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
. A constraint-based method for deriving type declarations from program statements is described. The...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Dynamically typed languages languages are very well suited for rapid prototyping, agile programming ...
AbstractRecent developments in the area of expressive types have the prospect to supply the ordinary...
10.1016/j.entcs.2006.10.041Electronic Notes in Theoretical Computer Science1747129-14
Programming language implementations bridge the gap between what the program developer sees and unde...
Because of our increasing dependence on software in every aspect of our lives, it is crucial that ou...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Formal verification of real-world software systems remains challenging for a number of reasons, incl...
Language extensions introduce high-level programming constructs that protect programmers from low-le...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
. A constraint-based method for deriving type declarations from program statements is described. The...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
The significance of type theory to the theory of programming languages has long been recognized. Ad...
Dynamically typed languages languages are very well suited for rapid prototyping, agile programming ...