On the power of coercion abstraction

DOI10.1145/2103656.2103699zbMath1321.68145OpenAlexW4206600381MaRDI QIDQ2942887

Didier Rémy, Julien Cretin

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

polymorphismconversionsubtypingcoercionretyping functionsSystem Fbounded polymorphismtype containment

Mathematics Subject Classification ID

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

Related Items (1)

Safe zero-cost coercions for Haskell

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