Optimal representations of polymorphic types with subtyping

DOI10.1023/A:1010056315933zbMATH Open0941.68076OpenAlexW1598913101MaRDI QIDQ1818009FDOQ1818009

Authors: Alexander Aiken, Edward L. Wimmers, Jens Palsberg 

Publication date: 8 February 2000

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010056315933

Recommendations

• scientific article; zbMATH DE number 1088035
• Polymorphic type inference with overloading and subtyping
• Simplifying subtyping constraints: a theory
• Polymorphism, subtyping, and type inference in MLsub
• Simplifying subtyping constraints

zbMATH Keywords

subtypingparametric polymorphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Pragmatic subtyping in polymorphic languages
• Polymorphic subtyping in O'Haskell
• Title not available (Why is that?)
• Simplifying subtyping constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simplifying subtyping constraints: a theory
• Inferring program specifications in polynomial-time
• Typed compilation of inclusive subtyping

This page was built for publication: Optimal representations of polymorphic types with subtyping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818009)