A. J. Kfoury

Publication Activity (10 Years)

Years Active: 1974-2004
Publications (10 Years): 0

Publications

A. J. Kfoury, J. B. Wells
Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. 311 (1-3) (2004)
Sébastien Carlier, Jeff Polakow, J. B. Wells, A. J. Kfoury
System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. ESOP (2004)
Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen
Orderly communication in the Ambient Calculus. Comput. Lang. Syst. Struct. 28 (1) (2002)
Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen
What Are Polymorphically-Typed Ambients? ESOP (2001)
A. J. Kfoury
A linearization of the Lambda-calculus and consequences. J. Log. Comput. 10 (3) (2000)
A. J. Kfoury
Type theory and rewriting theory for expressive, efficient and reliable programming languages. ACM SIGSOFT Softw. Eng. Notes 25 (1) (2000)
A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
Alpha-Conversion and Typability. Inf. Comput. 150 (1) (1999)
A. J. Kfoury, J. B. Wells
Principality and Decidable Type Inference for Finite-Rank Intersection Types. POPL (1999)
A. J. Kfoury, Santiago M. Pericás-Geertsen
Type Inference for Recursive Definitions. LICS (1999)
A. J. Kfoury, Alexei P. Stolboushkin
An Infinite Pebble Game and Applications. Inf. Comput. 136 (1) (1997)
A. J. Kfoury
Recursion Versus Iteration at Higher-Orders. FSTTCS (1997)
A. J. Kfoury, J. B. Wells
New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi LICS (1995)
A. J. Kfoury, J. B. Wells
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. LISP and Functional Programming (1994)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
An Analysis of ML Typability. J. ACM 41 (2) (1994)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15 (2) (1993)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Undecidability of the Semi-unification Problem Inf. Comput. 102 (1) (1993)
A. J. Kfoury, Jerzy Tiuryn
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus Inf. Comput. 98 (2) (1992)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93 (1) (1992)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
ML Typability is DEXTIME-Complete. CAAP (1990)
A. J. Kfoury, Jerzy Tiuryn
Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary) LICS (1990)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Undecidability of the Semi-Unification Problem (Preliminary Report) STOC (1990)
William M. Farmer, A. J. Kfoury
Minutes of the 4th annual LICS business meeting. SIGACT News 20 (4) (1989)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) LICS (1989)
A. J. Kfoury, Pawel Urzyczyn
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik (1989)
A. J. Kfoury
A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. RAIRO Theor. Informatics Appl. 22 (2) (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
A Proper Extension of ML with an Effective Type-Assignment. POPL (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
On the Computational Power of Universally Polymorphic Recursion LICS (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Hierarchy of Finitely Typed Functional Programs (Short Version) LICS (1987)
A. J. Kfoury
A linear-time algorithm to decide whether a binary word contains an overlap. Bull. EATCS 30 (1986)
A. J. Kfoury
The Unwind Property for Programs with Bounded Memory. Inf. Process. Lett. 21 (5) (1985)
A. J. Kfoury
Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) Inf. Control. 65 (2/3) (1985)
A. J. Kfoury, Pawel Urzyczyn
Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Informatica 22 (4) (1985)
A. J. Kfoury
Definability by Programs in First-Order Structures. Theor. Comput. Sci. 25 (1983)
A. J. Kfoury, Pawel Urzyczyn
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs (1983)
A. J. Kfoury
Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic. Logic of Programs (1981)
A. J. Kfoury
Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report) FOCS (1980)
A. J. Kfoury
Analysis of Simple Programs Over Different Sets of Primitives. POPL (1980)
A. J. Kfoury, David Michael Ritchie Park
On the Termination of Program Schemas Inf. Control. 29 (3) (1975)
A. J. Kfoury
Translatability of Schemas over Restricted Interpretations. J. Comput. Syst. Sci. 8 (3) (1974)