Assaf Kfoury
TitleCited byYear
HCI models, theories, and frameworks: Toward a multidisciplinary science
JM Carroll
Elsevier, 2003
936*2003
The undecidability of the semi-unification problem
AJ Kfoury, J Tiuryn, P Urzyczyn
Information and Computation 102 (1), 83-101, 1993
1951993
A programming approach to computability
AJ Kfoury, RN Moll, MA Arbib
Springer Science & Business Media, 2012
1452012
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
1451993
An analysis of ML typability
AJ Kfoury, J Tiuryn, P Urzyczyn
Journal of the ACM (JACM) 41 (2), 368-398, 1994
1171994
An introduction to formal language theory
RN Moll, MA Arbib, AJ Kfoury
Springer Science & Business Media, 2012
1082012
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
AJ Kfoury, JB Wells
ACM SIGPLAN Lisp Pointers 7 (3), 196-207, 1994
1081994
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
1061999
A linearization of the lambda-calculus and consequences
AJ Kfoury
Journal of Logic and Computation 10 (3), 411-436, 2000
84*2000
Principality and type inference for intersection types using expansion variables
AJ Kfoury, JB Wells
Theoretical Computer Science 311 (1-3), 1-70, 2004
822004
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
721995
A basis for theoretical computer science
MA Arbib, AJ Kfoury, RN Moll
Springer Science & Business Media, 2012
702012
Type reconstruction in finite rank fragments of the second-order λ-calculus
AJ Kfoury, J Tiuryn
Information and computation 98 (2), 228-257, 1992
671992
ML typability is DEXPTIME-complete
AJ Kfoury, J Tiuryn, P Urzyczyn
Colloquium on Trees in Algebra and Programming, 206-220, 1990
671990
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
472013
What are polymorphically-typed ambients?
T Amtoft, AJ Kfoury, SM Pericas-Geertsen
European Symposium on Programming, 206-220, 2001
452001
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
372004
Computational consequences and partial solutions of a generalized unification problem
AJ Kfoury, J Tiuryn, P Urzyczyn
[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 98-105, 1989
361989
Relating typability and expressiveness in finite-rank intersection type systems
AJ Kfoury, HG Mairson, FA Turbak, JB Wells
ACM SIGPLAN Notices 34 (9), 90-101, 1999
341999
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
312014
The system can't perform the operation now. Try again later.
Articles 1–20