Efficient inference of partial types
β Scribed by Dexter Kozen; Jens Palsberg; Michael I. Schwartzbach
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 799 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
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 quite recently, when O'Keefe and Wand gave an exponential time algorithm for type inference. In this paper we give an O(n 3) algorithm. Our algorithm constructs a certain finite automaton that represents a canonical solution to a given set of type constraints. Moreover, the construction works equally well for recursive types; this sovles an open problem stated by O' Keefe and Wand (in "
π SIMILAR VOLUMES
## Abstract In this study, we merge results of two recent directions in efficiency analysis researchβaggregation and bootstrapβapplied, as an example, to one of the most popular point estimators of individual efficiency: the data envelopment analysis (DEA) estimator. A natural context of the method
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
## Sumnm.ry Formulated in terms of latent failure times a survival model with two dependent competing risks is considered. Using this model, it is possible to introduce the probabilistic characteristics of each type of failure contribution to the joint effect of two damaging agents. Confidence bou