A Generic Functional Representation of Sorted Trees Supporting Attribution

DOI10.1007/978-3-642-37651-1_4zbMath1383.68016OpenAlexW96590349MaRDI QIDQ4916074

Nicole Rauch, Jean-Marie Gaillourdet, Patrick Michel, Arnd Poetzsch-Heffter

Publication date: 19 April 2013

Published in: Programming Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_4

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Uses Software

• Haskell
• Katja
• GAG

Cites Work

• Unnamed Item
• Increasing modularity and language-independency in automatically generated compilers
• GAG: a practical compiler generator
• Attribute grammars. Definitions, systems and bibliography
• Prototyping realistic programming languages based on formal specifications
• Attribute grammars fly first-class
• Weaving a web
• Scrap your boilerplate with XPath-like combinators
• The Zipper
• Scrap more boilerplate
• Semantics of context-free languages
• Recent Trends in Algebraic Development Techniques

This page was built for publication: A Generic Functional Representation of Sorted Trees Supporting Attribution