Coercions in a polymorphic type system

DOI10.1017/S0960129508006804zbMath1153.68010OpenAlexW2135683026MaRDI QIDQ3520150

Zhaohui Luo

Publication date: 15 August 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508006804

zbMATH Keywords

coercive subtyping

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Type Inference for ZFH ⋮ Manifest Fields and Module Mechanisms in Intensional Type Theory

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Inheritance as implicit coercion
• A theory of type polymorphism in programming
• Fundamental concepts in programming languages
• Transitivity in coercive subtyping
• Coercive subtyping
• Coherence and transitivity of subtyping as entailment
• A Machine-Oriented Logic Based on the Resolution Principle
• The Principal Type-Scheme of an Object in Combinatory Logic
• An implementation of LF with coercive subtyping and universes
• Coercion completion and conservativity in coercive subtyping

This page was built for publication: Coercions in a polymorphic type system