#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1988

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefan Kaes
- ESOP
- 1988

The introduction of unrestricted overloading in languagues with type systems based on implicit parametric potymorphism generally destroys the principal type property: namely that the type of every expression can uniformly be represented by a single type expression over some set of type variables. As a consequence, type inference in the presence of… (More)

- Stefan Kaes
- LISP and Functional Programming
- 1992

We present a unified approach to type inference in the presence of overloading and coercions based on the concept of <italic>constrained types</italic>. We define a generic inference system, show that subtyping and overloading can be treated as a special instance of this system and develop a simple algorithm to compute principal types. We prove the… (More)

- Wolfgang Henhapl, Stefan Kaes, Gregor Snelting
- Software Development Environments and CASE…
- 1991

- M. Jäger, Michael Gloger, Stefan Kaes
- VDM Europe
- 1988

- Stefan Kaes
- 2005

Type systems based on R. Milner’s concept of parametric polymorphism are recognized by the following facts: every well typed program has a uniquely defined denotational semantics, which ensures that the evaluation of a program will never produce a runtime type error. Additionally, every well typed program has a principal type such that every other type is… (More)

- ‹
- 1
- ›