Generative type abstraction and type-level computation

DOI10.1145/1926385.1926411MaRDI QIDQ5408546zbMATH OpenOpenAlexFDO

Authors Stephanie Weirich, Dimitrios Vytiniotis, Steve Zdancewic, Simon Peyton-Jones

Publication date 10 April 2014

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

Full work available at URL https://repository.upenn.edu/cgi/viewcontent.cgi?article=1598&context=cis_papers

zbMATH Keywords

Haskellnewtype derivingtype functions

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Non-parametric parametricity
• Non-parametric parametricity
• A type system for higher-order modules
• A type system for reflective program generators
• Recursive type generativity

Cited in

(6)

• Safe zero-cost coercions for Haskell
• A Church-style intermediate language for ML\(^{\text F}\)
• Introduction to generalized type systems
• A type system for reflective program generators
• Safe zero-cost coercions for Haskell
• Dynamic translucency with abstraction kinds and higher-order coercions

Describes a project that uses

Uses Software

• Agda

This page was built for publication: Generative type abstraction and type-level computation

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