Processes, Terms and Cycles: Steps on the Road to Infinity

DOI10.1007/11601548zbMath1171.68515OpenAlexW2234185834MaRDI QIDQ5898168

Paul-André Melliès

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11601548

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters ⋮ Abstract strategies and coherence ⋮ Unnamed Item ⋮ Dynamic game semantics ⋮ (In)efficiency and reasonable cost models

This page was built for publication: Processes, Terms and Cycles: Steps on the Road to Infinity