Hard combinators

DOI10.1016/j.entcs.2008.03.032zbMath1279.68020OpenAlexW2914778701MaRDI QIDQ2870311

Denis Béchet, Sylvain Lippi

Publication date: 17 January 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.2008.03.032

zbMATH Keywords

graph rewritinguniversal machinesasynchronous circuitsinteraction nets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Grammars and rewriting systems (68Q42)

Related Items (1)

Hard combinators

Cites Work

• Unnamed Item
• Unnamed Item
• Interaction combinators
• Hard combinators
• Encoding left reduction in the λ-calculus with interaction nets
• YALE
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Hard combinators