Type inference for the \lambda-calculus with records was investigated by Remy and also by Wand. In this paper we specialize Wands approach in order to obtain principal types. We develop a novel technique for the treatment of imperative constructs that fits well with Wands type inference. The result is type inference for a \lambda-calculus with records and imperative features. One application of this result is type checking for the object-oriented language OSMALL
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
ElementaryAffineLogic(EAL)isavariantofLinearLogiccharacterizingthecomputa- tional power of the eleme...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
We present a type inference algoritm and its verification for an object-oriented programming languag...
Object-oriented languages can be translated into a #lambda#-calculus with records. Therefore, type i...
We present a type inference algoritm and its verification for an object-oriented programming languag...
We show how type inference for object oriented programming languages with state can be performed wit...
We show that the type inference problem for a lambda calculus with records, including a record conca...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Abstract. We study the type inference problem for the Soft Type As-signment system (STA) for λ-calcu...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
This paper proves undecidability of type checking and type inference problems in some variants of ty...
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
ElementaryAffineLogic(EAL)isavariantofLinearLogiccharacterizingthecomputa- tional power of the eleme...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
We present a type inference algoritm and its verification for an object-oriented programming languag...
Object-oriented languages can be translated into a #lambda#-calculus with records. Therefore, type i...
We present a type inference algoritm and its verification for an object-oriented programming languag...
We show how type inference for object oriented programming languages with state can be performed wit...
We show that the type inference problem for a lambda calculus with records, including a record conca...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Abstract. We study the type inference problem for the Soft Type As-signment system (STA) for λ-calcu...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
This paper proves undecidability of type checking and type inference problems in some variants of ty...
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key...
Labeled types and a new relation between types are added to the lambda calculus of objects as descr...
We present a general algorithm for solving systems of inclusion constraints over type expressions. T...
ElementaryAffineLogic(EAL)isavariantofLinearLogiccharacterizingthecomputa- tional power of the eleme...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...