Follow
Assaf Kfoury
Title
Cited by
Cited by
Year
The undecidability of the semi-unification problem
AJ Kfoury, J Tiuryn, P Urzyczyn
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
2041990
Type reconstruction in the presence of polymorphic recursion
AJ Kfoury, J Tiuryn, P Urzyczyn
ACM Transactions on Programming Languages and Systems (TOPLAS) 15 (2), 290-311, 1993
1611993
A programming approach to computability
AJ Kfoury, RN Moll, MA Arbib
Springer Science & Business Media, 2012
1522012
An introduction to formal language theory
RN Moll, MA Arbib, AJ Kfoury
Springer Science & Business Media, 2012
1302012
An analysis of ML typability
AJ Kfoury, J Tiuryn, P Urzyczyn
Journal of the ACM (JACM) 41 (2), 368-398, 1994
1171994
Principality and decidable type inference for finite-rank intersection types
AJ Kfoury, JB Wells
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of …, 1999
1151999
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
AJ Kfoury, JB Wells
Proceedings of the 1994 ACM conference on LISP and functional programming …, 1994
1121994
A linearization of the lambda-calculus and consequences
AJ Kfoury
Journal of Logic and Computation 10 (3), 411-436, 2000
108*2000
Principality and type inference for intersection types using expansion variables
AJ Kfoury, JB Wells
Theoretical Computer Science 311 (1-3), 1-70, 2004
942004
New notions of reduction and non-semantic proofs of strong/spl beta/-normalization in typed/spl lambda/-calculi
AJ Kfoury, JB Wells
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 311-321, 1995
701995
ML typability is DEXPTIME-complete
AJ Kfoury, J Tiuryn, P Urzyczyn
Colloquium on Trees in Algebra and Programming, 206-220, 1990
701990
Type reconstruction in finite rank fragments of the second-order λ-calculus
AJ Kfoury, J Tiuryn
Information and computation 98 (2), 228-257, 1992
681992
A basis for theoretical computer science
MA Arbib, AJ Kfoury, RN Moll
Springer Science & Business Media, 2012
662012
Verifiably-safe software-defined networks for CPS
RW Skowyra, A Lapets, A Bestavros, A Kfoury
Proceedings of the 2nd ACM international conference on High confidence …, 2013
572013
A verification platform for sdn-enabled applications
R Skowyra, A Lapets, A Bestavros, A Kfoury
2014 IEEE International Conference on Cloud Engineering, 337-342, 2014
522014
What are polymorphically-typed ambients?
T Amtoft, AJ Kfoury, SM Pericas-Geertsen
European Symposium on Programming, 206-220, 2001
482001
System E: Expansion variables for flexible typing with linear and non-linear types and intersection types
S Carlier, J Polakow, JB Wells, AJ Kfoury
European Symposium on Programming, 294-309, 2004
382004
Definability by programs in first-order structures
AJ Kfoury
Theoretical Computer Science 25 (1), 1-66, 1983
341983
Relating typability and expressiveness in finite-rank intersection type systems
AJ Kfoury, HG Mairson, FA Turbak, JB Wells
Proceedings of the fourth ACM SIGPLAN international conference on Functional …, 1999
331999
Computational consequences and partial solutions of a generalized unification problem
AJ Kfoury, J Tiuryn, P Urzyczyn
Proceedings. Fourth Annual Symposium on Logic in Computer Science, 98, 99 …, 1989
321989
The system can't perform the operation now. Try again later.
Articles 1–20