19 search results - page 3 / 4 » On Strong Normalization of the Calculus of Constructions wit... |
CORR
2008
Springer
13 years 3 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
TYPES
2004
Springer
13 years 10 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...