Coercion and type inference

Mitchell, John C.

doi:10.1145/800017.800529

Cited by 154 publications

(77 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mitchell [8,9] introduced the problem of type reconstruction with coercions, including atomic coercions, and sketched the main algorithms for the case of well-founded types. This work concentrated on generating the set of atomic coercions that must hold among' the base types.…”

Section: A}-m:s Smentioning

confidence: 99%

See 1 more Smart Citation

Type reconstruction with recursive types and atomic subtyping

Tiuryn

Wand

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We consider the problenl of type reconstruction for )~-terms over a type system with recursive types and atomic subsumptions. This problem reduces to the problem of solving a finite set of inequalities over infinite trees. We show how to solve such inequalities by reduction to an infinite but well-structured set of inequalities over the base types. This infinite set of inequalities is solved using Biichi automata. The resulting Mgorithm is in DEXPTIME. This also improves the previous NEXPTIME upper bound for type reconstruction for finite types with atomic subtyping. We show that the key steps in the algorithm are PSPACE-hard.

show abstract

Section: A}-m:s Smentioning

confidence: 99%

“…John Mitchell, in his seminal paper [8,9], considered a system for type reconstruction for A-terms in whidl the set of types is augmented with a partial order (the subtype order), and the type inference rules are augmented with the subsumptiou rule…”

Section: Introductionmentioning

confidence: 99%

Type reconstruction with recursive types and atomic subtyping

Tiuryn

Wand

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For example, in object-oriented languages, the partial order is the inheritance hierarchy, and in languages that support type conversion, the relation in the partial order is the conversion relation, such as Int ≤ Double, which means that an integer can be converted to a double. This latter relation is sometimes considered as subtyping between primitive data types [Mit84]. In the Ptolemy II data type system, the type hierarchy if further constrained to be a lattice, and type constraints are formulated and solved over the lattice [XiL00] [Xio02].…”

Section: Introductionmentioning

confidence: 99%

A behavioral type system and its application in Ptolemy II

Lee

Xiong

2004

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Interface automata [deH01] have been introduced as an interface theory [deH01a] capable of functioning as a behavioral type system. Behavioral type systems describe dynamic properties of components and their compositions. Like traditional (data) type systems, behavioral type systems can be used to check compatibility of components. In this paper, we use interface automata to devise a behavioral type system for Ptolemy II, leveraging the contravariant and optimistic properties of interface automata to achieve behavioral subtyping and polymorphism. Ptolemy II is a software framework supporting concurrent component composition according to diverse models of computation. In this paper, we focus on representing the communication protocols used in component communication within the behavioral type system. In building this type system, we identify two key limitations in interface automata formalisms; we overcome these limitations with two extensions, transient states and projection automata. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking, which enable dynamic component creation, morphing application structure, and admission control. We discuss the trade-offs in the design of behavioral type systems.

show abstract

“…For example, in object-oriented languages, the partial order is the inheritance hierarchy, and in languages that support type conversion, the relation in the partial order is the conversion relation, such as int ≤ double, which means that an integer can be converted to a double. This latter relation is sometimes considered as subtyping between primitive data types [12]. In the Ptolemy II data type system, the type hierarchy if further constrained to be a lattice, and type constraints are formulated and solved over the lattice [15].…”

Section: Introductionmentioning

confidence: 99%

System-Level Types for Component-Based Design

Lee

Xiong

2001

Embedded Software

View full text Add to dashboard Cite

Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, such as the communication protocols between components. In our system, the interaction types and the dynamic behavior of components are defined using interface automata -an automata-based formalism. Type checking, which checks the compatibility of a component with a certain interaction type, is conducted through automata composition. Our type system is polymorphic in that a component may be compatible with more than one interaction type. We show that a subtyping relation exists among various interaction types and this relation can be described using a partial order. This system-level type order can be used to facilitate the design of polymorphic components and simplify type checking. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking. We illustrate our framework using a component-based design environment, Ptolemy II, and discuss the trade-offs in the design of system-level type systems.

show abstract

Coercion and type inference

Cited by 154 publications

References 16 publications

Type reconstruction with recursive types and atomic subtyping

Type reconstruction with recursive types and atomic subtyping

A behavioral type system and its application in Ptolemy II

System-Level Types for Component-Based Design

Contact Info

Product

Resources

About