Beta-Reduction As Unification

Beta-Reduction As Unification (1996)

Cached

Download Links

by A.J. Kfoury

Citations:

BibTeX

@MISC{Kfoury96beta-reductionas,
    author = {A.J. Kfoury},
    title = {Beta-Reduction As Unification},
    year = {1996}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

this report, we use a lean version of the usual system of intersection types, whichwe call . Hence, UP is also an appropriate unification problem to characterize typability of -terms in . Quite apart from the new light it sheds on fi-reduction, such an analysis turns out to have several other benefits

Citations

295	Concepts in Programming Languages - Mitchell - 2003
182	The Lambda Calculus: Its Syntax and Semantics, revised Edition - Barendregt - 1984
124	The undecidability of the second-order unification problem - Goldfarb - 1981
90	Complete restrictions of the Intersection Type Discipline - Bakel - 1992
82	Polymorphic type inference - Leivant - 1983
48	The undecidability of the semiunification problem - Kfoury, Tiuryn, et al. - 1993
46	Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems - Bakel - 1993
43	Two Extensions of Curry's Type Inference System - Cardone, Coppo
39	An extension of the basic functionality theory for the -calculus, Notre Dame J. of Formal Logic 21 - Coppo, Dezani-Ciancaglini - 1980
35	A type assignment for the strongly normalizable terms - Pottinger - 1980
32	On the undecidability of second-order unification - Levy, Veanes - 2000
27	A complete type inference algorithm for simple intersection types - Coppo, Giannini - 1992
22	Simple second-order languages for which unification is undecidable - Farmer - 1991
21	Essays on Combinatory Logic, Lambda-Calculus and Formalism, chapter The formulas-astypes notion of construction - Curry - 1980
20	P.: The number of proof lines and the size of proofs in first order logic - Krajíček, Pudlák - 1988
18	Addendum to new notions of reduction and non-semantic proofs of β-strong normalisation in typed λ-calculi - Kfoury, Wells
17	Strong normalization and typability with intersection types - Ghilezan - 1996
14	Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science 42 - Hindley - 1997
11	Principal Types and Unification For a Simple Intersection Type System - Coppo, Giannini - 1995
10	Second-order unification and type inference for Churchstyle polymorphism - Schubert - 1998
10	Strong normalization from weak normalization in typed -calculi - S��rensen - 1997
9	Unification of stratified second-order terms - Schmidt-Schau - 1994
7	Addendum to "New notions of reduction and non-semantic proofs of fi-strong normalization in typed -calculi - Kfoury, Wells - 1995
4	New notions of reduction and non-semantic proofs of beta -strong normalization in typed lambda -calculi - Kfoury, Wells - 1995
3	A Note on Intersection Types - Retore - 1995
2	The undecidability of k-provability - Bass - 1991
2	Strong Normalization from Weak Normalization in Typed Lambda Calculi", Report from - rensen, H - 1996
1	A linearization of the -calculus and an application - Kfoury
1	i cek and P. Pudl' ak, "The number of proof lines and the size of proofs in first order logic - Kraj' - 1988
1	e, "A Note on Intersection Types - Retor' - 1995
1	A Linearization of the -Calculus and an Application", under preparation - Kfoury
1	Unification of stratified second-order terms". Technical Report, Fachbereich Informatik, Johann Wolfgang-Goethe-Universitat Frankfurt - Schmidt-Schau - 1996
1	A Note on Intersection Types", INRIA report RR-2431 - Retore - 1995