Coercions in a polymorphic type system

DOI10.1017/S0960129508006804zbMATH Open1153.68010OpenAlexW2135683026MaRDI QIDQ3520150FDOQ3520150

Authors: 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

Recommendations

• Types for Proofs and Programs
• Coercive subtyping: theory and implementation
• scientific article; zbMATH DE number 3881858
• Coercive subtyping
• Implicit coercions in type systems

zbMATH Keywords

coercive subtyping

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

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

Cited In (8)

• Manifest Fields and Module Mechanisms in Intensional Type Theory
• Integrating coercion with subtyping and multiple dispatch
• Types for Proofs and Programs
• A computational view of implicit coercions in type theory
• Title not available (Why is that?)
• Type Inference for ZFH
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Haskell

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

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