A. J. Kfoury

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