Coercions in a polymorphic type system
From MaRDI portal
Publication:3520150
Recommendations
Cites work
- scientific article; zbMATH DE number 591911 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A theory of type polymorphism in programming
- An implementation of LF with coercive subtyping and universes
- Coercion completion and conservativity in coercive subtyping
- Coercive subtyping
- Coherence and transitivity of subtyping as entailment
- Fundamental concepts in programming languages
- Inheritance as implicit coercion
- The Principal Type-Scheme of an Object in Combinatory Logic
- Transitivity in coercive subtyping
Cited in
(15)- scientific article; zbMATH DE number 814794 (Why is no real title available?)
- Types for Proofs and Programs
- Equational axiomatization of bicoercibility for polymorphic types
- scientific article; zbMATH DE number 3881858 (Why is no real title available?)
- Integrating coercion with subtyping and multiple dispatch
- Safe zero-cost coercions for Haskell
- On the power of coercion abstraction
- Type inference for ZFH
- Safe zero-cost coercions for Haskell
- System F with coercion constraints
- A theory of typed coercions and its applications
- Manifest Fields and Module Mechanisms in Intensional Type Theory
- Implicit coercions in type systems
- A computational view of implicit coercions in type theory
- scientific article; zbMATH DE number 4180771 (Why is no real title available?)
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)
