A complete type system for functional languages

Widera, Manfred; Beierle, Christoph GND

This paper presents a powerful type system for functional programming languages consisting of an expressive type language and a type inference algorithm. In contrast to the usual approach it is complete in the sense that every program which is type correct is recognized as such. We get the advantage that every type error reported by our system is a real error. This is useful in debugging programs, since the programmer can rely on the error messages and need not check whether a returned function call really contains a type error and is not just hard to prove type correct. Soundness is a less important property in this context, because there are usually some more stages of debugging that can catch the other bugs.

Vorschau

Zitieren

Zitierform:

Widera, Manfred / Beierle, Christoph: A complete type system for functional languages. Hagen 1998. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe