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
Dependently-typed languages allow for a new paradigm: proof-oriented or type-driven programming, con...
The relationship between a type system’s specification and the implementation of the type checker is...
Generalized algebraic data types (GADTs) extend ordinary algebraic data types by refining the types...
AbstractRecent developments in the area of expressive types have the prospect to supply the ordinary...
Type systems have proved to be a powerful means of specifying and proving important program invaria...
Because of our increasing dependence on software in every aspect of our lives, it is crucial that ou...
10.1016/j.entcs.2006.10.041Electronic Notes in Theoretical Computer Science1747129-14
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
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...
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 software can be an enormous task. This fact brought some software engineers ...
The central topic of this thesis is the study of algorithms for type checking, both from the program...
AbstractThe use of typed intermediate languages can significantly increase the reliability of a comp...
Dependently-typed languages allow for a new paradigm: proof-oriented or type-driven programming, con...
The relationship between a type system’s specification and the implementation of the type checker is...
Generalized algebraic data types (GADTs) extend ordinary algebraic data types by refining the types...
AbstractRecent developments in the area of expressive types have the prospect to supply the ordinary...
Type systems have proved to be a powerful means of specifying and proving important program invaria...
Because of our increasing dependence on software in every aspect of our lives, it is crucial that ou...
10.1016/j.entcs.2006.10.041Electronic Notes in Theoretical Computer Science1747129-14
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
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...
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 software can be an enormous task. This fact brought some software engineers ...
The central topic of this thesis is the study of algorithms for type checking, both from the program...
AbstractThe use of typed intermediate languages can significantly increase the reliability of a comp...
Dependently-typed languages allow for a new paradigm: proof-oriented or type-driven programming, con...
The relationship between a type system’s specification and the implementation of the type checker is...
Generalized algebraic data types (GADTs) extend ordinary algebraic data types by refining the types...