• Published 1993

Principal Type Schemes for the StrictType Assignment

@inproceedings{BAKEL1993PrincipalTS,
  title={Principal Type Schemes for the StrictType Assignment},
  author={SystemSTEFFEN VAN BAKEL},
  year={1993}
}
  • SystemSTEFFEN VAN BAKEL
We study the strict type assignment system, a restriction of the intersection type discipline 6], and prove that it has the principal type property. We deene, for a term M, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for M can be obtained from the principal one by these operations, and that these map deducible pairs to deducible pairs. 

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Normalization, approximation, and semantics for combinator systems

VIEW 5 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Intersection Type Assignment Systems

VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Normalization Results for Typeable Rewrite Systems

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Strong Normalization of Typeable Rewrite Systems

VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Filter Models with Polymorphic Types

PolymorphicType Inference and Containment

  • S. Ronchi della Rocca
  • Information and Computation
  • 1988

The System F of Variable Types, Fifteen Years Later

A lter lambda model and the completeness of typeassignment

  • M. Coppo H. Barendregt, M. Dezani-Ciancaglini
  • The Journal of Symbolic Logic
  • 1983

Functional characters of solvable terms

  • M. Dezani-Ciancaglini M. Coppo, B. Venneri
  • Zeitschrift f  urMathematische Logik und Grundlagen der Mathematik
  • 1981