scientific article
From MaRDI portal
Publication:3738547
zbMath0602.68017MaRDI QIDQ3738547
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
quasi-varietiesinitial modelsinduction rulecomplete proof systemsequivalences and inequalities of recursive programsIF-THEN-ELSE programsinequational logics
Related Items (23)
Variétés d'automates descendants d'arbres infinis ⋮ On context-free trees ⋮ About fair asynchrony ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Algebraic solutions to recursion schemes ⋮ A domain equation for bisimulation ⋮ Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ The laws of Occam programming ⋮ Iterative and recursive matrix theories ⋮ Concurrent transition systems ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ The equational logic of fixed points ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ A unifying theorem for algebraic semantics and dynamic logics ⋮ Recursion induction principle revisited ⋮ Separately continuous algebras ⋮ Iterative factor algebras and induced metrics ⋮ Implementation of data types by algebraic methods ⋮ Infinitary tree languages recognized by \(\omega\)-automata ⋮ Axiomatisation des tests ⋮ The evaluation of first-order substitution is monadic second-order compatible
This page was built for publication:
