Publication:4116078
From MaRDI portal
zbMath0346.68041MaRDI QIDQ4116078
Publication date: 1975
Related Items
Unnamed Item, Expressive power of typed and type-free programming languages, Iterative factor algebras and induced metrics, All solutions of a system of recursion equations in infinite trees and other contraction theories, The category-theoretic solution of recursive program schemes, Combining data type and recursive process specifications using projection algebras, Algebraic specification of concurrent systems, Fundamental properties of infinite trees, Rational set of trees and the algebraic semantics of logic programming, Order completion monads, On the Herbrand-Kleene universe for nondeterministic computations, Extended macro grammars and stack controlled machines, Macro tree transducers, On context-free trees, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Full abstraction and limiting completeness in equational languages, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Partially additive categories and flow-diagram semantics, On the complexity of \(\omega\)-type Turing acceptors, Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I, Varieties of chain-complete algebras, Recursion-closed algebraic theories, DPDA's in 'Atomic normal form' and applications to equivalence problems, Recognizable formal power series on trees, Graph grammars and operational semantics, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, Algebraic and fixed point equations over inverse limits of algebras, Completeness results for the equivalence of recursive schemas, IO and OI. I, IO and OI. II, On some classes of interpretations, Program transformations and algebraic semantics, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, The equational logic of fixed points, \(L(A)=L(B)\)? decidability results from complete formal systems, A short scientific biography of Maurice Nivat, A unifying theorem for algebraic semantics and dynamic logics, Recursion induction principle revisited, Pushdown tree automata, Unnamed Item, Unnamed Item, Unnamed Item, 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, Infinite trees in normal form and recursive equations having a unique solution, Formal computations of non deterministic recursive program schemes, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item
