Hard combinators

DOI10.1016/J.ENTCS.2008.03.032MaRDI QIDQ2870311zbMATH OpenOpenAlexFDO

Authors 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

asynchronous circuitsgraph rewritinginteraction netsuniversal machines

Mathematics Subject Classification ID

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

Recommendations

• Universal Hard Interaction for Clockless Computation
• Interaction combinators
• Universal Boolean systems
• scientific article; zbMATH DE number 1722695
• Interaction Systems I: The theory of optimal reductions

Cites work

• CONCUR 2005 – Concurrency Theory
• Encoding left reduction in the λ-calculus with interaction nets
• Hard combinators
• scientific article; zbMATH DE number 2016070 (Why is no real title available?)
• scientific article; zbMATH DE number 2090088 (Why is no real title available?)
• Interaction combinators
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(4)

• scientific article; zbMATH DE number 1722695 (Why is no real title available?)
• Universal Boolean systems
• Hard combinators
• Universal Hard Interaction for Clockless Computation

This page was built for publication: Hard combinators

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