scientific article; zbMATH DE number 3512082
From MaRDI portal
Publication:4091917
Cited in
(91)- Fundamental properties of infinite trees
- A complete inference system for a class of regular behaviours
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
- Continuation semantics for flowgraph equations
- On context-free trees
- On flowchart theories. I. The deterministic case
- 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
- Final algebra semantics and data type extensions
- Unique fixed points vs. least fixed points
- On new roles for categorical algebra
- More on advice on structuring compilers and proving them correct
- Recursion-closed algebraic theories
- A class of fuzzy theories
- An algebraic model of synchronous systems
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
- Foundations of a theory of synchronous systems
- Semantic models for total correctness and fairness
- Varieties of ordered algebras
- Group axioms for iteration
- The equational logic of fixed points
- On functors preserving coproducts and algebras with iterativity
- Iteration and labelled iteration
- Complete Elgot monads and coalgebraic resumptions
- Axiomatizing schemes and their behaviors
- Equational logic of circular data type specification
- Condition/decision duality and the internal logic of extensive restriction categories
- Analytic calculi for monadic PNmatrices
- A new foundation for finitary corecursion and iterative algebras
- Base modules for parametrized iterativity
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Distributive laws for the coinductive solution of recursive equations
- Terminal coalgebras and free iterative theories
- Boolean restriction categories and taut monads
- Matrices, machines and behaviors
- A connection between concurrency and language theory
- Monads for behaviour
- Elgot theories: a new perspective of iteration theories (extended abstract)
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- An algebra of automata that includes both classical and quantum entities
- On rational monads and free iterative theories
- Unique, guarded fixed points in an additive setting: extended abstract
- On iteratable endofunctors
- Complete iterativity for algebras with effects
- Recursive program schemes and context-free monads
- From coalgebraic to monoidal traces
- Equational properties of fixed point operations in Cartesian categories: an overview
- Equational properties of stratified least fixed points (extended abstract)
- Equational axioms associated with finite automata for fixed point operations in cartesian categories
- Unifying guarded and unguarded iteration
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Calculating Colimits Compositionally
- Iteration Semirings
- A Description of Iterative Reflections of Monads (Extended Abstract)
- Graph expressions and graph rewritings
- How iterative reflections of monads are constructed
- Relative complexity of algebras
- scientific article; zbMATH DE number 139984 (Why is no real title available?)
- Topology and logic as a source of algebra
- Generalizing Substitution
- A complete proof system for nested term graphs
- Feedback, trace and fixed-point semantics
- A coalgebraic view of infinite trees and iteration
- A note on Coinduction and Weak Bisimilarity for While Programs
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- scientific article; zbMATH DE number 7080198 (Why is no real title available?)
- A semantics for hybrid iteration
- Processes with multiple entries and exits
- Finiteness and rational sequences, constructively
- Equational properties of fixed-point operations in Cartesian categories: an overview
- Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
- Semantic models for total correctness and fairness
- Some quasi-varieties of iteration theories
- The algebra of stream processing functions
- Program correctness and matricial iteration theories
- Equational properties of iterative monads
- Shades of iteration: from Elgot to Kleene
- Bicategories of processes
- A unifying categorical view of nondeterministic iteration and tests
- Uniform Elgot iteration in foundations
- Modular abstract syntax trees (MAST): substitution tensors with second-class sorts
- The solutions of two star-height problems for regular trees
- Algebras of iteration theories
- Algebraic characterization of reducible flowcharts
- Extensions of iterative congruences of free iterative algebras
- Implementation of data types by algebraic methods
- Deterministic and nondeterministic flowchart interpretations
- Algebras, polynomials and programs
- Closure functions and general iterates as reflectors
- A transformational characterization of if-then-else
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091917)
