✦ LIBER ✦

Type inference with constrained types

✍ Scribed by Odersky, Martin; Sulzmann, Martin; Wehr, Martin

Book ID: 101223356
Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 219 KB
Volume: 5
Category: Article
ISSN: 1074-3227
DOI: 10.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4

No coin nor oath required. For personal study only.

✦ Synopsis

We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories, and subtypes.

📜 SIMILAR VOLUMES

Polar Type Inference with Intersection T

Polar Type Inference with Intersection Types and ω

✍ Sébastien Carlier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Type Inference for Variant Object Types

✍ Michele Bugliesi; Santiago M. Pericás-Geertsen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Visual type inference

✍ Martin Erwig 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Type Inference for Pure Type Systems

✍ Paula Severi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Type inference with non-structural subty

Type inference with non-structural subtyping

✍ Jens Palsberg; Mitchell Wand; Patrick O'Keefe 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 805 KB

Type inference against races

✍ Cormac Flanagan; Stephen N. Freund 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 436 KB

The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supplied type annotations. This paper describes a type inference algorithm for rccjava. Due to the interaction of parameterized classe