The following pages link to Fixed-point calculus (Q674263):
Displaying 26 items.
- Computing kernels in directed bichromatic graphs (Q287022) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings (Q604456) (← links)
- Games and winning strategies (Q674272) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- Least reflexive points of relations (Q815002) (← links)
- Kleene under a modal demonic star (Q817579) (← links)
- Normal design algebra (Q844885) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- An algebra of hybrid systems (Q1001892) (← links)
- Datatype-generic termination proofs (Q1015386) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- A calculational approach to mathematical induction (Q1391737) (← links)
- An algebraic hardware/software partitioning algorithm (Q1613267) (← links)
- On the fixed points of certain types of functions for constructing associated calculi (Q1615328) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Encoding fairness in a synchronous concurrent program algebra (Q2024348) (← links)
- Modal algebra and Petri nets (Q2340252) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- Extreme solutions of equations (Q3801052) (← links)
- (Q4368846) (← links)
- Assertions and recursions (Q4645810) (← links)
- Categorical fixed point calculus (Q5057473) (← links)
- A Relation-Algebraic Treatment of the Dedekind Recursion Theorem (Q5098710) (← links)
- An Algebraic Approach to Refinement with Fair Choice (Q5403463) (← links)
