Functional-Logic Graph Parser Combinators

DOI10.1007/978-3-540-70590-1_18zbMath1145.68376OpenAlexW1863792697MaRDI QIDQ3522023

Steffen Mazanek, Mark Minas

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_18

Mathematics Subject Classification ID

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

Related Items (2)

Functional-Logic Graph Parser Combinators ⋮ An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Concepts and realization of a diagram editor generator based on hypergraph transformation
• Logic programming in a fragment of intuitionistic linear logic
• The complexity of graph languages generated by hyperedge replacement
• A needed narrowing strategy
• Functional-Logic Graph Parser Combinators
• Multi-paradigm Declarative Languages
• Handbook of Graph Grammars and Computing by Graph Transformation
• Higher-order functions for parsing
• Graph Transformations

This page was built for publication: Functional-Logic Graph Parser Combinators