An arithmetical proof of the strong normalization for the λ-calculus with recursive equations on types

An arithmetical proof of the strong normalization for the λ-calculus with recursive equations on types (2007)

Cached

Download Links

[www.lama.univ-savoie.fr]

by René David , Karim Nour

BibTeX

@MISC{David07anarithmetical,
    author = {René David and Karim Nour},
    title = {An arithmetical proof of the strong normalization for the λ-calculus with recursive equations on types},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Citations

997	The Lambda Calculus: its Syntax and Semantics - Barendregt - 1984
728	A formulation of the simple theory of types - Church - 1940
474	Lambda Calculi with Types - Barendregt - 1992
417	The calculus of constructions - Coquand, Huet - 1988
325	Proofs and Types - Girard, Lafont, et al. - 1989
270	Λµ-calculus: an algorithmic interpretation of classical natural deduction - Parigot - 1992
191	Intensional interpretations of functionals of finite type - Tait - 1967
163	The Lambda Calculus - Barendregt - 1981
98	Lambda calcul, types et modèle - KRIVINE - 1990
81	Inductive Types and Type Constraints in the Second-Order Lambda Calculus. Annals of pure and Applied logic 51 - Mendler - 1991
59	Strong normalization for second order classical natural deduction - Parigot
51	Recursive programming with proofs - PARIGOT - 1992
40	Classical Logic, Storage Operators and Second Order LambdaCalculs - KRIVINE - 1994
28	Short proofs of normalization for the simplytyped lambda-calculus, permutative conversions and Gödel’s T - Joachimski, Matthes - 2003
24	A new characterization of lambda definability - Jung, Tiuryn - 1993
23	of Strong Normalisation for Second Order Classical Natural Deduction, The - Parigot - 1997
18	Lambda-definability and logical relations - Plotkin - 1973
18	The Typed lambda-Calculus is not Elementary Recursive. FOCS - Statman - 1977
17	Normalization without reducibility - David - 2001
16	A short proof of the strong normalization of the simply typed λµ-calculus - David, Nour
14	On representation of data in lambda calculus - PARIGOT
12	A CPS-Translation of the λµ-Calculus - Groote - 1994
11	Arithmetical proofs of strong normalization results for the symmetric λµ-calculus - David, Nour
10	On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory - Groote - 1994
9	An inverse of the evaluation functional for typed lambda-calculus - Berger, Schwichtenberg - 1991
7	λ-definable functionals and βη-conversion - Statman - 1983
6	Cartesian Closed Categories and Typed Lambda-calculi - Lambek - 1985
5	Recursive types and the subject reduction theorem - Statman - 1994
4	The Undecidability of Unification - Huet - 1973
4	The Undecidability of λ-definability - Loader - 2001
4	Recursive Types and Type - Mendler - 1987
4	A proof of strongly uniform termination for Gödel’s T by methods from local predicativity. Archive fot Mathematical Logic 36 - Weiermann - 1997
2	A new type assignment for lambda terms Archiv - Coppo, Dezani - 1978
2	Quelques propriétés du typage des fonctions des entiers dans les entiers - Doyen - 1995
2	Leivant and M.O’Donnell. Simple and Second order Types Structures - Fortune, D - 1983
2	Equality between functionals. Logic Coll’73 - Friedman - 1975
2	Über eine bisher noch nicht benütztz Erweiterung des finiten Standpunkts - Gödel - 1958
2	The undecidability of the 2nd order unification problem - Goldfarb - 1981
2	Un algorithme non typable dans le système F - Krivine - 1987
2	Functions definable in the simply-typed lambda calculus - Schwichtenberg - 1976