scientific article; zbMATH DE number 3512082

zbMath0327.02040MaRDI QIDQ4091917

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

General topics in the theory of software (68N01) Computability and recursion theory (03D99) Turing machines and related notions (03D10) Foundations, relations to logic and deductive systems (18A15)

Related Items (84)

A connection between concurrency and language theory ⋮ Monads for behaviour ⋮ Continuation semantics for flowgraph equations ⋮ Feedback, trace and fixed-point semantics ⋮ Complete Iterativity for Algebras with Effects ⋮ On context-free trees ⋮ Some quasi-varieties of iteration theories ⋮ Condition/decision duality and the internal logic of extensive restriction categories ⋮ On flowchart theories. I. The deterministic case ⋮ Processes with multiple entries and exits ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Algebraic solutions to recursion schemes ⋮ On flowchart theories. II: The nondeterministic case ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Recursive Program Schemes and Context-Free Monads ⋮ From Coalgebraic to Monoidal Traces ⋮ Unnamed Item ⋮ How iterative reflections of monads are constructed ⋮ Final algebra semantics and data type extensions ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ The equational logic of fixed points ⋮ Unique fixed points vs. least fixed points ⋮ Calculating Colimits Compositionally ⋮ On new roles for categorical algebra ⋮ Program correctness and matricial iteration theories ⋮ Unnamed Item ⋮ Graph expressions and graph rewritings ⋮ Base modules for parametrized iterativity ⋮ More on advice on structuring compilers and proving them correct ⋮ Recursion-closed algebraic theories ⋮ Equational axioms associated with finite automata for fixed point operations in cartesian categories ⋮ Finiteness and rational sequences, constructively ⋮ A transformational characterization of if-then-else ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Iteration Semirings ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ A class of fuzzy theories ⋮ Unifying Guarded and Unguarded Iteration ⋮ On functors preserving coproducts and algebras with iterativity ⋮ Topology and logic as a source of algebra ⋮ An algebraic model of synchronous systems ⋮ Bicategories of processes ⋮ Semantic models for total correctness and fairness ⋮ Iteration and labelled iteration ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ A complete proof system for Nested Term Graphs ⋮ A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization ⋮ Foundations of a theory of synchronous systems ⋮ A Coalgebraic View of Infinite Trees and Iteration ⋮ Semantic models for total correctness and fairness ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ The algebra of stream processing functions ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Varieties of ordered algebras ⋮ Terminal coalgebras and free iterative theories ⋮ A note on Coinduction and Weak Bisimilarity for While Programs ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Boolean restriction categories and taut monads ⋮ A Description of Iterative Reflections of Monads (Extended Abstract) ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ An Algebra of Automata That Includes Both Classical and Quantum Entities ⋮ Generalizing Substitution ⋮ Axiomatizing schemes and their behaviors ⋮ The solutions of two star-height problems for regular trees ⋮ Equational logic of circular data type specification ⋮ Group axioms for iteration ⋮ On Rational Monads and Free Iterative Theories ⋮ Unique, guarded fixed points in an additive setting ⋮ On Iteratable Endofunctors ⋮ Matrices, machines and behaviors ⋮ Relative complexity of algebras ⋮ Algebras of iteration theories ⋮ Algebraic characterization of reducible flowcharts ⋮ Extensions of iterative congruences of free iterative algebras ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees ⋮ A complete inference system for a class of regular behaviours ⋮ Deterministic and nondeterministic flowchart interpretations ⋮ Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories ⋮ Algebras, polynomials and programs ⋮ Closure functions and general iterates as reflectors

This page was built for publication: