Type inference with partial types

DOI10.1016/0304-3975(94)90056-6zbMath0795.68026OpenAlexW2032851831MaRDI QIDQ1318726

Satish R. Thatte

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90056-6

zbMATH Keywords

type inferenceparametric polymorphismstatic typingpartial typesdynamic typingheterogeneous data structuressemilattice of subtypes

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Data structures (68P05) General topics in the theory of software (68N01)

Related Items

Proofs of a set of hybrid let-polymorphic type inference algorithms

Uses Software

• ML
• mini-ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type inference with subtypes
• The undecidability of the semi-unification problem
• A theory of type polymorphism in programming
• Dynamic typing: Syntax and proof theory
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus