de Groote, Ph., \The Conservation Theorem Revisited", Typed Lambda Calculi and Applications, TLCA '93, eds. Bezem and Groote, LNCS 664, pp 163-178, Springer Verlag 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999) (5 citations) (Correct)
....is however not the case for typed calculus. The snag lies in the fact that our typed terms have a type attached to the bound variable in the abstraction ( x:A:M ) This information is crucial for the type checking algorithm (without it, type checking in dependent type theory is undecidable Dowek [1993]) but it complicates the combination of and . For example consider x:A: y:B:y)x, x:A: y:B:y)x R x:A:x y:B:y These terms have a common reduct only if A and B have. This complication of was already known to the Automath community Nederpelt [1973] Con uence and ....
Dowek, G. [1993]. The undecidability of typability in the -calculus, Bezem and Groote [1993], pp. 139-145.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
No context found.
de Groote, Ph., \The Conservation Theorem Revisited", Typed Lambda Calculi and Applications, TLCA '93, eds. Bezem and Groote, LNCS 664, pp 163-178, Springer Verlag 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC