( en | de | ru )

 

Disambiguation of "Kfoury, A. J."

Author of the publication

copydeleteadd this publication to your clipboard
A linearization of the Lambda-calculus and consequences.

. J. Log. Comput., 10 (3): 411-436 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

J A Werner

A J Zensus

Manuel J A Eugster

Manuel J A Eugster

Jacobus A L J J Geijsen

 

Other publications of authors with the same name

A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap.. RAIRO Theor. Informatics Appl., 22 (2): 135-145 (1988)What Are Polymorphically-Typed Ambients?, , and . ESOP, volume 2028 of Lecture Notes in Computer Science, page 206-220. Springer, (2001)Type theory and rewriting theory for expressive, efficient and reliable programming languages.. ACM SIGSOFT Softw. Eng. Notes, 25 (1): 61-62 (2000)The Undecidability of the Semi-unification Problem, , and . Inf. Comput., 102 (1): 83-101 (January 1993)On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures., , and . Theor. Comput. Sci., 93 (1): 1-41 (1992)Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report)., and . Logic of Programs, volume 164 of Lecture Notes in Computer Science, page 279-289. Springer, (1983)Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.. Logic of Programs, volume 131 of Lecture Notes in Computer Science, page 150-166. Springer, (1981)Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic). Inf. Control., 65 (2/3): 98-121 (May 1985)Principality and Decidable Type Inference for Finite-Rank Intersection Types., and . POPL, page 161-174. ACM, (1999)The Unwind Property for Programs with Bounded Memory.. Inf. Process. Lett., 21 (5): 233-238 (1985)