The following pages link to (Q4091917):
Displaying 50 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Monads for behaviour (Q265824) (← links)
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
- How iterative reflections of monads are constructed (Q384934) (← links)
- Bicategories of processes (Q674474) (← links)
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- Algebras of iteration theories (Q789159) (← links)
- Algebraic characterization of reducible flowcharts (Q789162) (← links)
- Extensions of iterative congruences of free iterative algebras (Q792751) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- Deterministic and nondeterministic flowchart interpretations (Q796975) (← links)
- Algebras, polynomials and programs (Q802882) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- A transformational characterization of if-then-else (Q913480) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- A complete inference system for a class of regular behaviours (Q1057072) (← links)
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories (Q1059405) (← links)
- Continuation semantics for flowgraph equations (Q1080651) (← links)
- On context-free trees (Q1082826) (← links)
- On flowchart theories. I. The deterministic case (Q1093364) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- On flowchart theories. II: The nondeterministic case (Q1101203) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- Unique fixed points vs. least fixed points (Q1142573) (← links)
- On new roles for categorical algebra (Q1145206) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- A class of fuzzy theories (Q1170604) (← links)
- An algebraic model of synchronous systems (Q1186811) (← links)
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization (Q1193888) (← links)
- Foundations of a theory of synchronous systems (Q1199824) (← links)
- Semantic models for total correctness and fairness (Q1208419) (← links)
- Varieties of ordered algebras (Q1229897) (← links)
- Group axioms for iteration (Q1283821) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- On functors preserving coproducts and algebras with iterativity (Q1727997) (← links)
- Iteration and labelled iteration (Q1744383) (← links)
- Complete Elgot monads and coalgebraic resumptions (Q1744384) (← links)
- Axiomatizing schemes and their behaviors (Q1819574) (← links)
- Equational logic of circular data type specification (Q1825026) (← links)
- Condition/decision duality and the internal logic of extensive restriction categories (Q2133172) (← links)
- A new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
- Base modules for parametrized iterativity (Q2435311) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
- Terminal coalgebras and free iterative theories (Q2500475) (← links)
- Boolean restriction categories and taut monads (Q2503320) (← links)
- Matrices, machines and behaviors (Q2563761) (← links)
- Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) (Q2805168) (← links)
