The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

A. J. Kfoury: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    ML Typability is DEXTIME-Complete. [Citation Graph (1, 0)][DBLP]
    CAAP, 1990, pp:206-220 [Conf]
  2. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Hierarchy of Finitely Typed Functional Programs (Short Version) [Citation Graph (1, 0)][DBLP]
    LICS, 1987, pp:225-235 [Conf]
  3. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-Unification Problem (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1990, pp:468-476 [Conf]
  4. A. J. Kfoury, Pawel Urzyczyn
    Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:186-199 [Conf]
  5. Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen
    What Are Polymorphically-Typed Ambients? [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:206-220 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    ESOP, 2004, pp:294-309 [Conf]
  7. A. J. Kfoury
    Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:173-184 [Conf]
  8. A. J. Kfoury
    Recursion Versus Iteration at Higher-Orders. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:57-73 [Conf]
  9. 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]
  10. A. J. Kfoury, Santiago M. Pericás-Geertsen
    Type Inference for Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:119-129 [Conf]
  11. A. J. Kfoury, Jerzy Tiuryn
    Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary) [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:2-11 [Conf]
  12. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Computational Power of Universally Polymorphic Recursion [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:72-81 [Conf]
  13. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:98-105 [Conf]
  14. 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]
  15. 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]
  16. 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]
  17. A. J. Kfoury
    Analysis of Simple Programs Over Different Sets of Primitives. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:56-61 [Conf]
  18. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    A Proper Extension of ML with an Effective Type-Assignment. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:58-69 [Conf]
  19. A. J. Kfoury, J. B. Wells
    Principality and Decidable Type Inference for Finite-Rank Intersection Types. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:161-174 [Conf]
  20. A. J. Kfoury, Pawel Urzyczyn
    Necessary and Sufficient Conditions for the Universality of Programming Formalisms. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:4, pp:347-377 [Journal]
  21. Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen
    Orderly communication in the Ambient Calculus. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 2002, v:28, n:1, pp:29-60 [Journal]
  22. 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]
  23. 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]
  24. A. J. Kfoury, David Michael Ritchie Park
    On the Termination of Program Schemas [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:29, n:3, pp:243-251 [Journal]
  25. A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
    Alpha-Conversion and Typability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:1, pp:1-21 [Journal]
  26. A. J. Kfoury, Alexei P. Stolboushkin
    An Infinite Pebble Game and Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:136, n:1, pp:53-66 [Journal]
  27. A. J. Kfoury, Jerzy Tiuryn
    Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:98, n:2, pp:228-257 [Journal]
  28. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-unification Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:1, pp:83-101 [Journal]
  29. 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]
  30. 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]
  31. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    An Analysis of ML Typability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:368-398 [Journal]
  32. 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]
  33. 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]
  34. 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]
  35. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:1, pp:1-41 [Journal]
  36. 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]
  37. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Type Reconstruction in the Presence of Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1993, v:15, n:2, pp:290-311 [Journal]

Search in 0.228secs, Finished in 0.229secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002