Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kfoury, A.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Principality and type inference for intersection types using expansion variables
A.J. Kfoury
,
J.B. Wells
Theoretical Computer Science
311
(1-3), 2004, pp. 1-70
Alpha-conversion and typability
A.J. Kfoury
,
S. Ronchi della Rocca
,
J. Tiuryn
,
P. Urzyczyn
Information and Computation
150
(1), 1999, pp. 1-21
An infinite pebble game and applications
A.J. Kfoury
,
A.P. Stolboushkin
Information and Computation
136
(1), 1997, pp. 53-66
Recursion versus iteration at higher-orders
A.J. Kfoury
Lecture Notes in Computer Science
1346
, 1997, pp. 57-73
New notions of reduction and non-semantic proofs of strong
\beta
-normalization in typed
\lambda
-calculi
A.J. Kfoury
,
J.B. Wells
Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (San Diego, California, June 26-29, 1995)
, 1995, pp. 311-321
An analysis of ML typability
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Journal of the ACM
41
(2), 1994, March, pp. 368-398
The undecidability of the semi-unification problem
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Information and Computation
102
(1), 1993, January, pp. 83-101
On the expressive power of finitely typed and universally polymorphic recursive procedures
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Theoretical Computer Science
93
, 1992, pp. 1-41
Type reconstruction in finite rank fragments of the second-order
\lambda
-calculus
A.J. Kfoury
,
J. Tiuryn
Information and Computation
98
(2), 1992, June, pp. 228-257
The undecidability of the semi-unification problem
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 468-476
Necessary and sufficient conditions for the universality of programming formalisms
A.J. Kfoury
,
P. Urzyczyn
Acta Informatica
22
(4), 1985, pp. 347-377
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
A.J. Kfoury
Information and Control
65
(2/3), 1985, pp. 98-121
The unwind property for programs with bounded memory
A.J. Kfoury
Information Processing Letters
21
(5), 1985, November, pp. 233-238
Definability by programs in first-order structures
A.J. Kfoury
Theoretical Computer Science
25
(1), 1983, pp. 1-66
Loop elimination and loop reduction - a model-theoretic analysis of programs
A.J. Kfoury
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 173-184
Translatability of schemas over restricted interpretations
A.J. Kfoury
Journal of Computer and System Sciences
8
, 1974, pp. 387-408