Principality and type inference for intersection types using expansion variables von Kfoury, A.J., Wells, J.B.

Volltext

A Programming Approach to Computability von Kfoury, A. J, Moll, Robert N, Arbib, Michael A

Volltext

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types von Carlier, Sébastien, Polakow, Jeff, Wells, J. B., Kfoury, A. J.

Volltext

An analysis of ML typability von KFOURY, A. J, TIURYN, J, URZYCZYN, P

Volltext

Type reconstruction in the presence of polymorphic recursion von Kfoury, A. J., Tiuryn, J., Urzyczyn, P.

Volltext

Recursion versus iteration at higher-orders von Kfoury, A. J.

Volltext

Alpha-Conversion and Typability von Kfoury, A.J., Ronchi della Rocca, S., Tiuryn, J., Urzyczyn, P.

Volltext

Type reconstruction in finite rank fragments of the second-order λ-calculus von Kfoury, A.J., Tiuryn, J.

Volltext

An Infinite Pebble Game and Applications von Kfoury, A.J., Stolboushkin, A.P.

Volltext

On the expressive power of finitely typed and universally polymorphic recursive procedures von Kfoury, A.J., Tiuryn, J., Urzyczyn, P.

Volltext

The unwind property for programs with bounded memory von Kfoury, A.J.

Volltext

The Undecidability of the Semi-unification Problem von Kfoury, A.J., Tiuryn, J., Urzyczyn, P.

Volltext

Necessary and sufficient conditions for the universality of programming formalisms von KFOURY, A. J, URZYCZYN, P

Volltext

Systematic verification of safety properties of arbitrary network protocol compositions using CHAIN von Bradley, A.D., Bestavros, A., Kfoury, A.J.

Volltext

Orderly communication in the Ambient Calculus von Amtoft, Torben, Kfoury, Assaf J., Pericas-Geertsen, Santiago M.

Volltext

Some open questions in the theory of program schemes and dynamic logics von Kfoury, A J, Stolboushkin, A P, Urzyczyn, P

Volltext

A linearization of the Lambda-calculus and consequences von Kfoury, A.

Volltext

ML typability is dexptime-complete von Kfoury, A. J., Tiuryn, J., Urzyczyn, P.

Volltext

A linear-time algorithm to decide whether a binary word contains an overlap von Kfoury, A. J.

Volltext

Definability by programs in first-order structures von Kfoury, A.J.

Volltext