63 search results - page 3 / 13 » Short proofs of strong normalization |
APAL
2008
15 years 1 months ago
2008
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
109
click to vote
LFCS
1994
Springer
15 years 5 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
128
click to vote
TYPES
2004
Springer
15 years 6 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...
144
Voted
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
e type system for the lmdElulus enrihed with reurE sive nd oreursive funtions over equiEindutive nd Eoindutive types is presented in whih ll wel...