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

DOI10.1017/S0956796807006557MaRDI QIDQ5437034zbMATH OpenOpenAlexFDO

Authors Geoffrey Washburn, Stephanie Weirich

Publication date 18 January 2008

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796807006557

zbMATH Keywords

iteration operatorsfusion laws

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• A completeness theorem in modal logic
• A formulation of the simple theory of types
• A generalization of short-cut fusion and its correctness proof
• A hybrid approach to online and offline partial evaluation
• A judgmental reconstruction of modal logic
• A modal analysis of staged computation
• A proof theory for generic judgments
• Automatic synthesis of typed -programs on term algebras
• Meta-programming with names and necessity
• Polytypic values possess polykinded types
• Practical type inference for arbitrary-rank types
• Primitive recursion for higher-order abstract syntax
• Recursion over objects of functional type
• Type-safe run-time polytypic programming

Cited in

(8)

• Programs using syntax with first-class binders
• Lightweight higher-kinded polymorphism
• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
• scientific article; zbMATH DE number 1262424 (Why is no real title available?)
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Syntax for Free: Representing Syntax with Binding Using Parametricity
• Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
• A weakly initial algebra for higher-order abstract syntax in Cedille

Describes a project that uses

Uses Software

• Twelf
• Haskell

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 Q5437034)