On the power of coercion abstraction

DOI10.1145/2103656.2103699MaRDI QIDQ2942887zbMATH OpenOpenAlexFDO

Authors Julien Cretin, Didier Rémy

Publication date 11 September 2015

Published in Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00582570v3/file/RR-7587.pdf

zbMATH Keywords

polymorphismsubtypingcoercionretyping functionsSystem Fconversionbounded polymorphismtype containment

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• System F with coercion constraints
• Coercions in a polymorphic type system
• Coercive subtyping via mappings of reduction behaviour
• Soundness of Coercion in the Calculus of Constructions
• Types for Proofs and Programs

Cited in

(4)

• Safe zero-cost coercions for Haskell
• System F with coercion constraints
• scientific article; zbMATH DE number 1497808 (Why is no real title available?)
• scientific article; zbMATH DE number 1948402 (Why is no real title available?)

This page was built for publication: On the power of coercion abstraction

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