18 search results - page 2 / 4 » tphol 2007 |
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...