Safe zero-cost coercions for Haskell-Reference-Cited by-同舟云学术

Safe zero-cost coercions for Haskell

Published:2014-11-26 Issue:9 Volume:49 Page:189-202
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Breitner Joachim¹,Eisenberg Richard A.²,Peyton Jones Simon³,Weirich Stephanie²

Affiliation:

1. Karlsruhe Institute of Technology, Karlsruhe, Germany

2. University of Pennsylvania, Philadelphia, PA, USA

3. Microsoft Research, Cambridge, United Kingdom

Abstract

Generative type abstractions -- present in Haskell, OCaml, and other languages -- are useful concepts to help prevent programmer errors. They serve to create new types that are distinct at compile time but share a run-time representation with some base type. We present a new mechanism that allows for zero-cost conversions between generative type abstractions and their representations, even when such types are deeply nested. We prove type safety in the presence of these conversions and have implemented our work in GHC.

Funder

Deutsche Telekom Stiftung

Division of Computing and Communication Foundations

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/2692915.2628141

Reference15 articles.

1. Associated type synonyms

2. Associated types with class

3. Closed type families with overlapping equations

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Flexible semi-automatic support for type migration of primitives for C/C++ programs;2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER);2022-03

2. Ghosts of departed proofs (functional pearl);ACM SIGPLAN Notices;2018-12-07

3. Ghosts of departed proofs (functional pearl);Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell;2018-09-17

4. Generic deriving of generic traversals;Proceedings of the ACM on Programming Languages;2018-07-30