A type-preserving compiler in Haskell

DOI10.1145/1411204.1411218MaRDI QIDQ5178757zbMATH OpenOpenAlexWikidataFDO

Authors Louis-Julien Guillemette, Stefan Monnier

Publication date 16 March 2015

Published in Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1411204.1411218

zbMATH Keywords

compilationhigher-order abstract syntaxde Bruijntyped assembly language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Type-safe code transformations in Haskell
• Programming type-safe transformations using higher-order abstract syntax
• Fun with type functions
• ANF preserves dependent types up to extensional equality
• scientific article; zbMATH DE number 2163037

Cited in

(9)

• Compiling Haskell to JavaScript through Clean's core
• Evidence normalization in System FC (invited talk)
• System FC with explicit kind equality
• Fun with type functions
• Scrap Your Type Applications
• A typed representation for HTML and XML documents in Haskell
• ANF preserves dependent types up to extensional equality
• Type-safe code transformations in Haskell
• Advanced Functional Programming

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: A type-preserving compiler in Haskell

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