Partial types for the 2-calculus were introduced by Thatte in 1988 as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. In that paper he showed that type inference for partial types was semidecidable. Decidability remained open until q
Safety analysis versus type inference for partial types
โ Scribed by Jens Palsberg; Michael I. Schwartzbach
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 352 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
We give a polymorphic account of the relational algebra. We introduce a formalism of ''type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ''principal'' type for a given expression. The principal type of an expression is a formula that sp
Potter and Anderson [1] have developed a Bayesian decision procedure requiring the specification of a class of prior distributions restricted to have a minimal probability content for a given subset of the parameter space. They do not, however, provide a method for the selection of that subset. We