A.J. Kfoury, Beta-reduction as unification, in Logic, Algebra and Computer Science, H. Rasiowa Memorial Conference, December #### (D. Niwinski, Ed.), Banach Center Publication Vol. 46 (####) 137-158. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pp. 137--158. Springer-Verlag, 1999. Supersedes [Kfo96] but omits a few proofs included in the latter.
Implementing Compositional Analysis Using Intersection.. - Kfoury, Washburn, Wells (2003) (3 citations) Self-citation (Kfoury) (Correct)
No context found.
Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Exact Intersection Typing Inference and Call-by-Name.. - Adam Bakewell Sebastien (2004) Self-citation (Kfoury) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pp. 137--158. Springer-Verlag, 1999. Supersedes [11] but omits a few proofs included in the latter.
Implementing Compositional Analysis Using Intersection Types.. - Kfoury, al. (2002) (3 citations) Self-citation (Kfoury) (Correct)
No context found.
Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pp. 137--158. Springer-Verlag, 1999. Supersedes [Kfo96] but omits a few proofs included in the latter.
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1998) (19 citations) Self-citation (Kfoury) (Correct)
No context found.
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.
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1998) (19 citations) Self-citation (Kfoury) (Correct)
No context found.
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.
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pp. 137--158. Springer-Verlag, 1999. Supersedes [Kfo96] but omits a few proofs included in the latter.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) Self-citation (Kfoury) (Correct)
No context found.
Kfoury, A.J., "Beta-reduction as unification". Technical report, Boston University, 96-019, June 1997. Also available at URL: http://www.cs.bu.edu/faculty/kfoury/research.html
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (4 citations) Self-citation (Kfoury) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Volume 46, pp. 137--158. Springer-Verlag, 1999. Supersedes [Kfo96] but omits a few proofs included in the latter.
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) Self-citation (Kfoury) (Correct)
No context found.
Kfoury, A.J., "Beta-Reduction as Unification", in Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference), December 1996.
Implementing Compositional Analysis Using Intersection.. - Kfoury, Washburn, Wells (2003) (3 citations) Self-citation (Kfoury) (Correct)
No context found.
Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Beta-Reduction As Unification - Kfoury (1996) (8 citations) Self-citation (Kfoury) (Correct)
.... The key result of this section is Theorem 17, stating that M is fi strong normalizable iff M is typable in ; As there are many different proofs in the literature for what is essentially the same result, we omit the details of our own proof and refer the reader instead to our technical report [11]. Section 4 and Section 5 are largely independent of each other. Section 6 presents the main results of the paper, by connecting the analyses of the two preceding sections. We develop a procedure Gamma which, when applied to a term M , returns a instance Gamma(M ) of fiU such that M is typable ....
....subterm in M , without reference to one of its occurrences. We write P M for P ae M or P j M . Acknowledgements. The final version of this paper is based on detailed comments and criticisms which the author received from Pawe# Urzyczyn for an earlier technical report with the same title ([11]) Special thanks are due to Pawe# for all his help. 4. A unification problem. We define a unification problem, called fi unification (for want of a better name) and denoted fiU, which gives an appropriate algebraic characterization of fi strong normalization. The result is proved in Section 6. ....
[Article contains additional citation context not shown here]
A. J. Kfoury, "Beta-reduction as unification". Technical report, Boston University, 96-019, June 1997. Also available at URL: http://www.cs.bu.edu/faculty/kfoury/ research.html
Principality and Decidable Type Inference for Finite-Rank.. - Kfoury, Wells (1999) (19 citations) Self-citation (Kfoury) (Correct)
.... the following types: 1 = Gff fi; 2 = 1 Gff = Gff fi) Gff; 3 = 2 fi = Gff fi) Gff fi: Figure 3: Skeleton S2 and derivation D2 for M2 = x:y:xy) z:zz) 3 Lambda Compatible Beta Unification The problem of fi unification was introduced and shown undecidable by Kfoury in [Kfo9X] This section introduces compatible fi unification, a restriction of fi unification, in order to develop a principality property and in preparation for a unification algorithm presented later. Definition 3.1 (E paths) The set EVar of all finite sequences of E variables is also called ....
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.
On Type Inference - In The Intersection (Correct)
No context found.
A.J. Kfoury, Beta-reduction as unification, in Logic, Algebra and Computer Science, H. Rasiowa Memorial Conference, December #### (D. Niwinski, Ed.), Banach Center Publication Vol. 46 (####) 137-158.
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (1 citation) (Correct)
No context found.
Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
On Type Inference in the - Intersection Type Discipline (Correct)
No context found.
A.J. Kfoury, Beta-reduction as unification, in Logic, Algebra and Computer Science, H. Rasiowa Memorial Conference, December 1996 (D. Niwinski, Ed.), Banach Center Publication Vol. 46 (1999) 137-158.
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2004) (1 citation) (Correct)
No context found.
Assaf J. Kfoury. Beta-reduction as unification. In D. Niwinski, editor, Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Type Inference with Expansion Variables and Intersection.. - Carlier, Wells (5 citations) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Expansion: the Crucial Mechanism for Type Inference with.. - Carlier, Wells (2005) (1 citation) (Correct)
No context found.
A. J. Kfoury. Beta-reduction as unification. In D. Niwinski, ed., Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996.
Intersection Typed λ-calculus - Rocca (2002) (Correct)
No context found.
Kfoury A., "Beta-reduction as Unification", Logic Algebra and Computer Science, Polish Academy of Science, Warsaw, (1999), pp. 241-262.
On Type Inference in the Intersection Type Discipline - Boudol, Zimmer (2004) (3 citations) (Correct)
No context found.
A.J. Kfoury, Beta-reduction as unification, in Logic, Algebra and Computer Science, H. Rasiowa Memorial Conference, December #### (D. Niwinski, Ed.), Banach Center Publication Vol. 46 (####) 137-158.
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