Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting

DOI10.1007/978-3-540-70590-1_27MaRDI QIDQ3522032zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Encoding Strategies in the Lambda Calculus with Interaction Nets
• Encoding left reduction in the λ-calculus with interaction nets
• Encoding distributed process calculi into LMNtal
• scientific article; zbMATH DE number 1231498
• YALE: yet another lambda evaluator based on interaction nets

Cites work

• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Confluence properties of weak and strong calculi of explicit substitutions
• Encoding distributed process calculi into LMNtal
• Explicit substitution. On the edge of strong normalization
• Explicit substitutions
• scientific article; zbMATH DE number 2185670 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• Membrane Computing
• Rewriting Techniques and Applications
• Typed Lambda Calculi and Applications
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(2)

• LMNtal as a hierarchical logic programming language
• scientific article; zbMATH DE number 3942987 (Why is no real title available?)

Describes a project that uses

Uses Software

• LMNtal

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522032)