Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers

DOI10.1016/j.entcs.2011.02.015zbMath1291.68108OpenAlexW2006660981WikidataQ113318285 ScholiaQ113318285MaRDI QIDQ5166620

R. Tchougong, B. Fotsing, Eric Badouel

Publication date: 27 June 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.02.015

zbMATH Keywords

attribute grammarattribute evaluationcyclic data structurezipper

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items

Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition, Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using circular programs to eliminate multiple traversals of data
• Attribute grammars and recursive program schemes. I. II
• Initial Algebra Semantics Is Enough!
• Attribute Grammars and Mathematical Semantics
• Initial Algebra Semantics and Continuous Algebras
• An order-algebraic definition of knuthian semantics
• Monadic parsing in Haskell
• The Zipper
• Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers
• Semantics of context-free languages