Algebraic semantics
From MaRDI portal
Publication:1158947
zbMath0474.68010MaRDI QIDQ1158947
Publication date: 1981
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Free algebras (08B20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Equational classes, universal algebra in model theory (03C05) Other classes of algebras (08C99)
Related Items (44)
The Birkhoff variety theorem for continuous algebras ⋮ Conditional rewriting logic: Deduction, models and concurrency ⋮ Termination, deadlock and divergence ⋮ An algebraic semantics approach to the effective resolution of type equations ⋮ Bi-rewriting, a term rewriting technique for monotonic order relations ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Testing equivalences for processes ⋮ An Action Semantics Based on Two Combinators ⋮ Recursive Program Schemes and Context-Free Monads ⋮ The category-theoretic solution of recursive program schemes ⋮ The monadic second-order logic of graphs, II: Infinite graphs of bounded width ⋮ Unnamed Item ⋮ Graphes canoniques de graphes algébriques ⋮ Unnamed Item ⋮ Decidable subcases of the equivalence problem for recursive program schemes ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ On second-order iterative monads ⋮ Iteration Semirings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Unnamed Item ⋮ Pushdown tree automata ⋮ A fully abstract denotational model for observational precongruence ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Step failures semantics and a complete proof system ⋮ Semantics of Higher-Order Recursion Schemes ⋮ A logico-algebraic approach to the model theory of knowledge ⋮ Quantifier elimination for infinite terms ⋮ Solving Algebraic Equations Using Coalgebra ⋮ Algebraic Systems and Pushdown Automata ⋮ Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages ⋮ Group axioms for iteration ⋮ Equational theories for automata ⋮ A general theory of action languages ⋮ Linda-based applicative and imperative process algebras ⋮ A Mezei-Wright theorem for categorical algebras ⋮ Fundamental properties of infinite trees ⋮ Axiomatising finite delay operators ⋮ Toward an infinitary logic of domains: Abramsky logic for transition systems ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series ⋮ Specification-oriented semantics for communicating processes ⋮ On powerdomains and modality ⋮ A short scientific biography of Maurice Nivat
This page was built for publication: Algebraic semantics
