Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism

DOI10.1145/944705.944728zbMATH Open1315.68061OpenAlexW2021447352MaRDI QIDQ5261280FDOQ5261280

Geoffrey Washburn, Stephanie Weirich

Publication date: 2 July 2015

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

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

zbMATH Keywords

parametric polymorphismparametricityhigher-order abstract syntaxcatamorphismmodal type system

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (6)

• The calculus of dependent lambda eliminations
• Title not available (Why is that?)
• Mechanizing type environments in weak HOAS
• A simple nominal type theory
• Title not available (Why is that?)
• Type-safe code transformations in Haskell

   Recommendations

• Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism 👍 👎
• Parametric higher-order abstract syntax for mechanized semantics 👍 👎
• Practical Programming with Higher-Order Encodings and Dependent Types 👍 👎
• Higher-order abstract syntax in Isabelle/HOL 👍 👎
• A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions 👍 👎

This page was built for publication: Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism

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