research-article

Safe zero-cost coercions for Haskell

Authors:

Joachim Breitner,

Richard A. Eisenberg,

Simon Peyton Jones,

Stephanie WeirichAuthors Info & Claims

ICFP '14: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming

Pages 189 - 202

https://doi.org/10.1145/2628136.2628141

Published: 19 August 2014 Publication History

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.

References

[1]

Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones, and Stephanie Weirich. Safe zero-cost coercions for Haskell (extended version), Tech. Report MS-CIS-14-07, University of Pennsylvania, 2014.

[2]

James Cheney and Ralf Hinze. First-class phantom types, Tech. report, Cornell University, 2003.

[3]

Manuel M. T. Chakravarty, Gabriele Keller, and Simon Peyton Jones. Associated type synonyms, ICFP, ACM, 2005, pp. 241--253.

Digital Library

[4]

Manuel M. T. Chakravarty, Gabriele Keller, Simon Peyton Jones, and Simon Marlow. Associated types with class, POPL, ACM, 2005, pp. 1--13.

Digital Library

[5]

Richard A. Eisenberg, Dimitrios Vytiniotis, Simon Peyton Jones, and Stephanie Weirich. Closed type families with overlapping equations, POPL, ACM, 2014, pp. 671--683.

Digital Library

[6]

Jacques Garrigue. On variance, injectivity, and abstraction, OCaml Meeting, Boston., September 2013.

[7]

Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate with class: Extensible generic functions, ICFP, 2005.

Digital Library

[8]

Simon Marlow (editor). Haskell 2010 language report, 2010.

[9]

Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The definition of Standard ML (revised), 1997.

Digital Library

[10]

Simon Peyton Jones and J Launchbury. Unboxed values as first class citizens, FPCA, LNCS, vol. 523, 1991, pp. 636--666.

Digital Library

[11]

Simon Peyton Jones, Andrew Tolmach, and Tony Hoare. Playing by the rules: rewriting as a practical optimisation technique in GHC, Haskell Workshop, 2001, pp. 203--233.

[12]

Gabriel Scherer and Didier Rémy. GADTs meet subtyping, ESOP, 2013, pp. 554--573.

Digital Library

[13]

Dimitrios Vytiniotis, Simon Peyton Jones, and José Pedro Magalhães. Equality proofs and deferred type errors: A compiler pearl, ICFP, ACM, 2012, pp. 341--352.

Digital Library

[14]

Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc, POPL, ACM, 1989, pp. 60--76.

Digital Library

[15]

Stephanie Weirich, Dimitrios Vytiniotis, Simon Peyton Jones, and Steve Zdancewic. Generative type abstraction and type-level computation, POPL, ACM, 2011, pp. 227--240.

Digital Library

[16]

Brent A. Yorgey, Stephanie Weirich, Julien Cretin, Simon Peyton Jones, Dimitrios Vytiniotis, and José Pedro Magalhães. Giving Haskell a promotion, TLDI, ACM, 2012, pp. 53--66.

Digital Library

Cited By

Maclaurin DRadul APaszke A(2022)The Foil: Capture-Avoiding Substitution With No Sharp EdgesProceedings of the 34th Symposium on Implementation and Application of Functional Languages10.1145/3587216.3587224(1-10)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3587216.3587224
Gissurarson MMista AStoughton AVassena M(2020)Short Paper: Weak Runtime-Irrelevant Typing for SecurityProceedings of the 15th Workshop on Programming Languages and Analysis for Security10.1145/3411506.3417595(13-17)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3411506.3417595
Yallop JDolan S(2019)First-Class SubtypesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.294.4294(74-85)Online publication date: 16-May-2019
https://doi.org/10.4204/EPTCS.294.4
Show More Cited By

Index Terms

Safe zero-cost coercions for Haskell
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Abstract data types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

Safe zero-cost coercions for Haskell
ICFP '14

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 Class Instances for Type-Level Lambdas in Haskell
TFP 2015: Revised Selected Papers of the 16th International Symposium on Trends in Functional Programming - Volume 9547

Haskell 2010 lacks flexibility in creating instances of type classes for type constructors with multiple type arguments. We would like to make the order of type arguments to a type constructor irrelevant to how type class instances can be specified. ...
Generative type abstraction and type-level computation
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Modular languages support generative type abstraction, ensuring that an abstract type is distinct from its representation, except inside the implementation where the two are synonymous. We show that this well-established feature is in tension with the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '14: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming

August 2014

390 pages

ISBN:9781450328739

DOI:10.1145/2628136

General Chair:
Johan Jeuring
Universiteit Utrecht, The Netherlands
,
Program Chair:
Manuel M.T. Chakravarty
University of New South Wales, Australia

ACM SIGPLAN Notices Volume 49, Issue 9
ICFP '14
September 2014
361 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2692915
Editors:
Mark W. Bailey
Hamilton College, Clinton, NY
,
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Sarita Adve
University of Illinois at Urbana-Champ
Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

ICFP'14

Sponsor:

SIGPLAN

ICFP'14: ACM SIGPLAN International Conference on Functional Programming

September 1 - 6, 2014

Gothenburg, Sweden

Acceptance Rates

ICFP '14 Paper Acceptance Rate 28 of 85 submissions, 33%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
365
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Maclaurin DRadul APaszke A(2022)The Foil: Capture-Avoiding Substitution With No Sharp EdgesProceedings of the 34th Symposium on Implementation and Application of Functional Languages10.1145/3587216.3587224(1-10)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3587216.3587224
Gissurarson MMista AStoughton AVassena M(2020)Short Paper: Weak Runtime-Irrelevant Typing for SecurityProceedings of the 15th Workshop on Programming Languages and Analysis for Security10.1145/3411506.3417595(13-17)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3411506.3417595
Yallop JDolan S(2019)First-Class SubtypesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.294.4294(74-85)Online publication date: 16-May-2019
https://doi.org/10.4204/EPTCS.294.4
Christiansen DDiatchki IDockins RHendrix JRavitch T(2019)Dependently typed Haskell in industry (experience report)Proceedings of the ACM on Programming Languages10.1145/33417043:ICFP(1-16)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341704
Devriese DEisenberg R(2019)Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the μVeriFast verifier as a case studyProceedings of the 12th ACM SIGPLAN International Symposium on Haskell10.1145/3331545.3342589(1-14)Online publication date: 8-Aug-2019
https://dl.acm.org/doi/10.1145/3331545.3342589
Winant TDevriese D(2018)Coherent explicit dictionary application for HaskellACM SIGPLAN Notices10.1145/3299711.324275253:7(81-93)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242752
Blöndal BLöh AScott R(2018)Deriving via: or, how to turn hand-written instances into an anti-patternACM SIGPLAN Notices10.1145/3299711.324274653:7(55-67)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242746
Winant TDevriese DWu N(2018)Coherent explicit dictionary application for HaskellProceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242752(81-93)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242752
Blöndal BLöh AScott RWu N(2018)Deriving via: or, how to turn hand-written instances into an anti-patternProceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242746(55-67)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242746
Weirich SVoizard Ade Amorim PEisenberg R(2017)A specification for dependent types in HaskellProceedings of the ACM on Programming Languages10.1145/31102751:ICFP(1-29)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110275
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents