Parametric Compositional Data Types

@inproceedings{Bahr2012ParametricCD,
  title={Parametric Compositional Data Types},
  author={P. Bahr and Tom Hvitved},
  booktitle={MSFP},
  year={2012}
}
  • P. Bahr, Tom Hvitved
  • Published in MSFP 2012
  • Computer Science
  • In previous work we have illustrated the benefits that compositional data types (CDTs) offer for implementing languages and in general for dealing with abstract syntax trees (ASTs). Based on Swierstra's data types \'a la carte, CDTs are implemented as a Haskell library that enables the definition of recursive data types and functions on them in a modular and extendable fashion. Although CDTs provide a powerful tool for analysing and manipulating ASTs, they lack a convenient representation of… CONTINUE READING
    Dynamic Symbolic Computation for Domain-Specific Language Implementation
    Compilation à la Carte
    4
    Towards Modular Compilers for Effects
    9
    Reusable Components for Lightweight Mechanisation of Programming Languages
    7
    Instructed late binding
    Programming macro tree transducers
    10

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES
    Compositional data types
    40
    Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
    60
    Parametric higher-order abstract syntax for mechanized semantics
    72
    Primitive recursion for higher-order abstract syntax
    82
    Bananas in space: extending fold and unfold to exponential types
    127
    Foundations for structured programming with GADTs
    60
    Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space)
    99
    Higher-order abstract syntax
    729