A. J. Kfoury, J. B. Wells A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. [Citation Graph (0, 0)][DBLP] LISP and Functional Programming, 1994, pp:196-207 [Conf]
A. J. Kfoury, J. B. Wells New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi [Citation Graph (0, 0)][DBLP] LICS, 1995, pp:311-321 [Conf]
A. J. Kfoury Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic. [Citation Graph (0, 0)][DBLP] Logic of Programs, 1981, pp:150-166 [Conf]
A. J. Kfoury, Pawel Urzyczyn Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). [Citation Graph (0, 0)][DBLP] Logic of Programs, 1983, pp:279-289 [Conf]
A. J. Kfoury A linear-time algorithm to decide whether a binary word contains an overlap. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1986, v:30, n:, pp:74-79 [Journal]
A. J. Kfoury Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) [Citation Graph (0, 0)][DBLP] Information and Control, 1985, v:65, n:2/3, pp:98-121 [Journal]
A. J. Kfoury The Unwind Property for Programs with Bounded Memory. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1985, v:21, n:5, pp:233-238 [Journal]
A. J. Kfoury A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. [Citation Graph (0, 0)][DBLP] ITA, 1988, v:22, n:2, pp:135-145 [Journal]
A. J. Kfoury Translatability of Schemas over Restricted Interpretations. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1974, v:8, n:3, pp:387-408 [Journal]
A. J. Kfoury A linearization of the Lambda-calculus and consequences. [Citation Graph (0, 0)][DBLP] J. Log. Comput., 2000, v:10, n:3, pp:411-436 [Journal]
A. J. Kfoury Definability by Programs in First-Order Structures. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1983, v:25, n:, pp:1-66 [Journal]
A. J. Kfoury, J. B. Wells Principality and type inference for intersection types using expansion variables. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:311, n:1-3, pp:1-70 [Journal]