Academic
Publications
A Machine-assisted Proof that Well Typed Expressions Cannot Go Wrong

A Machine-assisted Proof that Well Typed Expressions Cannot Go Wrong,Ana Bove

A Machine-assisted Proof that Well Typed Expressions Cannot Go Wrong   (Citations: 4)
BibTex | RIS | RefWorks Download
This paper deals with the application of constructive type theory to the theory of programming languages. The main aim of this work is to investigate constructive formalisations of the mathematics of programs. Here, we consider a small typed functional language and prove some properties about it, arriving at the property that establishes that well typed expressions cannot go wrong. First, we give the definitions and proofs in an informal style, and then we present and explain the formalisation...
Published in 1998.
Cumulative Annual
Sort by: