Constrained types and their expressiveness

Authors:
Jens Palsberg;Scott Smith
Affiliations:
MIT, Cambridge, MA;Johns Hopkins Univ., Baltimore, Maryland
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1996

Citing 6
Cited 14

Type inference in the presence of overloading, subtyping and recursive types

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient recursive subtyping

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inclusion constraints and type inference

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A type system equivalent to flow analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sound polymorphic type inference for objects

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications

Software evolution and integration

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
On the complexity of set-based analysis

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
From polyvariant flow information to intersection and union types

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Research Frontiers in Object Technology

Information Systems Frontiers
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Type inference for record concatenation and subtyping

Information and Computation
Automatic discovery of covariant read-only fields

ACM Transactions on Programming Languages and Systems (TOPLAS)
Hm(x) type inference is clp(x) solving

Journal of Functional Programming
A type system equivalent to a model checker

ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and trace effects for object orientation

Higher-Order and Symbolic Computation
The nuggetizer: abstracting away higher-orderness for program verification

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A type system equivalent to a model checker

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Control-flow analysis of functional programs

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A constrained type consists of both a standard type and a constraint set. Such types enable efficient type inference for object-oriented languages with polymorphism and subtyping, as demonstrated by Eifrig, Smith, and Trifonov. Until now, it has been unclear how expressive constrained types are. In this article we study constrained types without universal quantification. We prove that they accept the same programs as the type system of Amadio and Cardelli with subtyping and recursive types. This result gives a precise connection between constrained types and the standard notion of types.