Search Results - "Kfoury, A.J."

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

“…Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations…”
Get full text

Typed abstraction of complex network compositions by Bestavros, A., Bradley, A.D., Kfoury, A.J., Matta, I.

“…The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of…”
Get full text

Type inference for recursive definitions by Kfoury, A.J., Pericas-Geertsen, S.M.

“…We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction,…”
Get full text

New notions of reduction and non-semantic proofs of strong /spl beta/-normalization in typed /spl lambda/-calculi by Kfoury, A.J., Wells, J.B.

“…Two notions of reduction for terms of the /spl lambda/-calculus are introduced and the question of whether a /spl lambda/-term is /spl beta/-strongly…”
Get full text

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

“…Formal correctness of complex multi-party protocols can be difficult to verify. While models of specific sign constraints, protocols which lend themselves to…”
Get full text

Programming Examples Needing Polymorphic Recursion by Hallett, J.J., Kfoury, A.J.

“…Inferring types for polymorphic recursive function definitions (abbreviated to polymorphic recursion) is a recurring topic on the mailing lists of popular…”
Get full text

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

“…There are two results in this paper. We first prove that alpha-conversion on types can be eliminated from the second-orderλ-calculusFof Girard and Reynolds…”
Get full text

A typed model for encoding-based protocol interoperability by Bradley, A.D., Bestavros, A., Kfoury, A.J.

“…Documentation of the HTTP protocol includes precise descriptions of the syntax of the protocol, but lacks similarly precise specification of the semantics of…”
Get full text

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

“…We generalize the pebble game to infinite directed acyclic graphs and use this generalization to give new and shorter proofs of the following well-known…”
Get full text

SNBENCH: a development and run-time platform for rapid deployment of sensor network applications by Bestavros, A., Bradley, A.D., Kfoury, A.J., Ocean, M.J.

“…We envision the emergence of general-purpose, well-provisioned sensor networks - which we call "Sensoria" - that are embedded in (or overlayed atop) physical…”
Get full text

Type reconstruction in finite-rank fragments of the polymorphic lambda -calculus by Kfoury, A.J., Tiuryn, J.

“…It is proven that the problem of type reconstruction in the polymorphic lambda -calculus of rank two is polynomial-time equivalent to the problem of type…”
Get full text

Computational consequences and partial solutions of a generalized unification problem by Kfoury, A.J., Tiuryn, J., Urzyczyn, P.

“…A generalization of first-order unification, called semiunification, is studied with two goals in mind: (1) type-checking functional programs relative to an…”
Get full text

On the computational power of universally polymorphic recursion by Kfoury, A.J., Tiuryn, J., Urzczyn, P.

“…ML/sup +/ is an extension of the functional language ML that allows the actual parameters of recursively called functions to have types that are generic…”
Get full text