Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting

DOI10.1007/978-3-540-70590-1_27zbMath1145.68378OpenAlexW1527527487MaRDI QIDQ3522032

Kazunori Ueda

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_27

Mathematics Subject Classification ID

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

Related Items (1)

LMNtal as a hierarchical logic programming language

Uses Software

• LMNtal

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit substitution. On the edge of strong normalization
• Encoding Distributed Process Calculi into LMNtal
• Confluence properties of weak and strong calculi of explicit substitutions
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Explicit substitutions
• YALE
• Membrane Computing
• Typed Lambda Calculi and Applications
• Rewriting Techniques and Applications

This page was built for publication: Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting