An encoding of the \(\lambda \)-calculus in the string MultiSet rewriting calculus

DOI10.1007/s00236-024-00456-wMaRDI QIDQ6541035

Attila Bagossy, Péter Battyányi

Publication date: 17 May 2024

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• In search of elegance in the theory and practice of computation. Essays dedicated to Peter Buneman
• Formal molecular biology
• Executable biochemical space for specification and analysis of biochemical systems
• Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus
• An Intermediate Language for the Simulation of Biological Systems
• An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus
• A semantics for lambda calculi with resources
• Brane Calculi

This page was built for publication: An encoding of the \(\lambda \)-calculus in the string MultiSet rewriting calculus