AbstractWe extend type constraints with kind constraints to increase the expressiveness of constraint-based nominal type systems. In the context of object-oriented programming languages, they offer an alternative to the use of F-bounded polymorphism to type homogeneous binary methods. We also introduce the notion of partially polymorphic methods to describe a common situation in object-oriented hierarchies, and show how these can be typed in a modular fashion with kind constraints
We are developing a static type system for object-oriented languages that strives to guarantee stati...
We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous w...
We present a static type system for object-oriented languages which strives to provide static typech...
AbstractWe extend type constraints with kind constraints to increase the expressiveness of constrain...
There exists an identifiable programming style based on the widespread use of type information handl...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
We present a new predicative and decidable type system, called ML , suitable for languages that inte...
Many computer programs have the property that they work correctly on a variety of types of input; s...
International audiencePolymorphic variants are a useful feature of the OCaml language whose current ...
We present a type inference system for a language with object-oriented features such as polymorphic ...
AbstractThe aim of this work is largely a practical one. A widely employed style of programming, par...
Subtyping is used in language design, type checking and program analysis. Mitchell and others have s...
UID/CEC/04516/2019 PTDC/EEICTP/4293/2014This work introduces the novel concept of kind refinement, w...
AbstractWe show how the Hindley/Milner polymorphic type system can be extended to incorporate overlo...
Our objective is to understand the notion of type in programming languages, present a model of typed...
We are developing a static type system for object-oriented languages that strives to guarantee stati...
We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous w...
We present a static type system for object-oriented languages which strives to provide static typech...
AbstractWe extend type constraints with kind constraints to increase the expressiveness of constrain...
There exists an identifiable programming style based on the widespread use of type information handl...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
We present a new predicative and decidable type system, called ML , suitable for languages that inte...
Many computer programs have the property that they work correctly on a variety of types of input; s...
International audiencePolymorphic variants are a useful feature of the OCaml language whose current ...
We present a type inference system for a language with object-oriented features such as polymorphic ...
AbstractThe aim of this work is largely a practical one. A widely employed style of programming, par...
Subtyping is used in language design, type checking and program analysis. Mitchell and others have s...
UID/CEC/04516/2019 PTDC/EEICTP/4293/2014This work introduces the novel concept of kind refinement, w...
AbstractWe show how the Hindley/Milner polymorphic type system can be extended to incorporate overlo...
Our objective is to understand the notion of type in programming languages, present a model of typed...
We are developing a static type system for object-oriented languages that strives to guarantee stati...
We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous w...
We present a static type system for object-oriented languages which strives to provide static typech...
DOI
Add to ORKG