(Enter summary)
Abstract: We de
ne a new uni
cation problem, which we call
-uni
cation and which can
be used to characterize the
-strong normalization of terms in the -calculus. We prove the
undecidability of
-uni
cation, its connection with the system of intersection types, and several
of its basic properties. (Update)
Cited by: More
On Type Inference - In The Intersection
(Correct)
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004)
(Correct)
On Type Inference in the - Intersection Type Discipline
(Correct)
Similar documents (at the sentence level):
33.1%: Beta-Reduction As Unification - Kfoury (1996)
(Correct)
Active bibliography (related documents): More All
0.6: A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000)
(Correct)
0.6: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.4: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998)
(Correct)
Similar documents based on text: More All
0.3: Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003)
(Correct)
0.3: Helena Rasiowa And Cecylia Rauszer Research On Logical.. - Pawlak (1997)
(Correct)
0.2: Properties of Conflict Sets in the Plane - Siersma (1998)
(Correct)
Related documents from co-citation: More All
18: Principality and type inference for intersection types using expansion variables
- Kfoury, Wells - 2003
15: Principality and decidable type inference for finite-rank intersection types
- Kfoury, Wells - 1999
14: An extension of the basic functionality theory for the -calculus (context) - Coppo, Dezani-Ciancaglini - 1980
BibTeX entry: (Update)
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996). Springer-Verlag, 199X. http://citeseer.ist.psu.edu/article/kfoury96betareduction.html More
@techreport{ kfoury96betareduction,
author = "A. J. Kfoury",
title = "Beta-Reduction as Unification",
number = "1996-019",
month = "8,",
year = "1996",
url = "citeseer.ist.psu.edu/article/kfoury96betareduction.html" }
Citations (may not include all citations):
229
Foundations for Programming Languages (context) - Mitchell - 1996
210
Its Syntax and Semantics (context) - Barendregt - 1984
191
Polymorphic Type Inference (context) - Leivant - 1983
68
An extension of basic functionality theory for -calculus (context) - Coppo, Dezani-Ciancaglini - 1980
64
A Type Assignment for the Strongly Normalizable -terms (context) - Pottinger - 1980
47
Two extensions of Curry's type inference system (context) - Cardone, Coppo - 1990
42
Annals of Pure and Applied Logic (context) - Bass - 1991
39
A complete type inference algorithm for simple intersection .. (context) - Coppo, Giannini - 1992
35
Complete restrictions of the intersection type discipline
- van Bakel - 1992
23
The undecidability of the second-order uni cation problem (context) - Goldfarb - 1981
17
New Notions of Reduction and Non-Semantic Proofs of Beta Str..
- Kfoury, Wells - 1995
16
Cambridge Tracts in Theoretical Computer Science (context) - Hindley - 1997
14
The undecidability of the semi-uni cation problem (context) - Kfoury, Tiuryn et al. - 1993
7
Beta-reduction as uni cation (context) - Kfoury - 1997
5
Simple second-order languages for which uni cation is undeci.. (context) - Farmer - 1991
3
The number of proof lines and the size of proofs in rst orde.. (context) - cek, Pudl - 1988
3
postscript available at: ftp://ftp (context) - on, Types et al. - 1995
3
Second-order uni cation and type inference for Church-style .. (context) - Schubert - 1997
1
Principal Types and Uni cation For a Simple Intersection Typ.. (context) - Coppo, Giannini - 1995
1
calculus and an application (context) - Kfoury, of
1
Linear second-order uni cation (context) - Levy - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.church-project.org/reports/electronic/): More
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004)
(Correct)
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003)
(Correct)
Meta-Programming through Typeful Code Representation - Chen, Xi (2003)
(Correct)
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