𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Type Inference for Variant Object Types

✍ Scribed by Michele Bugliesi; Santiago M. Pericás-Geertsen

Book ID
112252703
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
236 KB
Volume
177
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Type inference with constrained types
Type inference with constrained types
✍ Odersky, Martin; Sulzmann, Martin; Wehr, Martin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

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, unde

Breaking through then3 barrier: Faster o
Breaking through then3 barrier: Faster object type inference
✍ Henglein, Fritz 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

Abadi and Cardelli present a series of type systems for their object calculi, four of which are first-order. Palsberg has shown how typability in each one of these systems can be decided in time O(n 3 ) and space O(n 2 ), where n is the size of an untyped object expression, using an algorithm base

Type inference and strong static type ch
Type inference and strong static type checking for Promela
✍ Alastair F. Donaldson; Simon J. Gay 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 750 KB

The Spin model checker and its specification language Promela have been used extensively in industry and academia to check the logical properties of distributed algorithms and protocols. Model checking with Spin involves reasoning about a system via an abstract Promela specification, thus the techni