scientific article
From MaRDI portal
Publication:2753681
zbMath0973.08003MaRDI QIDQ2753681
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)
Related Items (8)
A connection between concurrency and language theory ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Unnamed Item ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ Equational theories for automata ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
This page was built for publication:
