A process calculus with finitary comprehended terms

DOI10.1007/s00224-013-9468-xzbMath1283.68233arXiv0903.2914OpenAlexW2119846136MaRDI QIDQ385508

C. A. Middelburg, Jan A. Bergstra

Publication date: 2 December 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.2914

zbMATH Keywords

process calculusACP process algebracomprehended termmeadow enriched ACP process algebravariable-binding operator

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Transformation of fractions into simple fractions in divisive meadows ⋮ A process calculus with finitary comprehended terms ⋮ Using Hoare Logic in a Process Algebra Setting ⋮ Division by zero in non-involutive meadows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A process calculus with finitary comprehended terms
• Inversive meadows and divisive meadows
• Meadows and the equational specification of division
• Universal algebra in higher types
• An algebraic generalization of Frege structures -- binding algebras
• The algebra of communicating processes with empty process
• Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
• Process algebra with timing
• On the power of higher-order algebraic specification methods
• Splitting bisimulations and retrospective conditions
• The rational numbers as an abstract data type
• Process algebra for synchronous communication
• Applications of Process Algebra
• Elementary Algebraic Specifications of the Rational Complex Numbers

This page was built for publication: A process calculus with finitary comprehended terms