Addendum to `New notions of reduction and non-semantic proofs of β-strong normalization in typed λ-calculi

Addendum to `New notions of reduction and non-semantic proofs of β-strong normalization in typed λ-calculi (1995)

Cached

Download Links

by A. J. Kfoury , J. B. Wells

Citations:

BibTeX

@TECHREPORT{Kfoury95addendumto,
    author = {A. J. Kfoury and J. B. Wells},
    title = {Addendum to `New notions of reduction and non-semantic proofs of β-strong normalization in typed λ-calculi},
    institution = {},
    year = {1995}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

166	A call-by-need lambda calculus - Ariola, Felleisen, et al. - 1995
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
92	Complete restrictions of the Intersection Type Discipline - Bakel - 1992
81	Inductive Types and Type Constraints in the Second-Order Lambda Calculus. Annals of pure and Applied logic 51 - Mendler - 1991
29	Proofs of strong normalization - Gandy - 1980
26	The conservation theorem revisited - Groote - 1993
25	Une équivalence sur les lambda termes - Regnier - 1994
18	Strict functionals for termination proofs - Pol, Schwichtenberg
15	Exactly estimating functionals and strong normalization - Vrijer - 1987
13	Nouvelles notions de réduction en lambda calcul, Thèse de doctorat, Université de Nancy 1 - Vidal - 1989
9	New notions of reduction and non-semantic proofs of -strong normalization in typed -calculi - Kfoury, Wells - 1994
8	Normalization revisited - Scedrov - 1987
2	An early proof of normalization by A.M.Turing - Gandy
2	Proofs and types. Number 7 in Cambridge Tracts in Theoetical Computer Science - Girard, Taylor, et al. - 1989
1	An analysis of ML typability. In 15th Colloq. Trees Algebra Program., vol. 431 of LNCS - Kfoury, Tiuryn, et al. - 1990