Pages that link to "Item:Q1391737"
From MaRDI portal
The following pages link to A calculational approach to mathematical induction (Q1391737):
Displaying 19 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- A relation-algebraic approach to the ``Hoare logic'' of functional dependencies (Q406457) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- Datatype-generic termination proofs (Q1015386) (← links)
- Programming from metaphorisms (Q1683699) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Programming from Galois connections (Q1931902) (← links)
- Left omega algebras and regular equations (Q1931903) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Formal derivation of greedy algorithms from relational specifications: a tutorial (Q2374306) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- Complete Lattices and Up-To Techniques (Q3498446) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)
- Algebraic coherent confluence and higher globular Kleene algebras (Q5060195) (← links)
- (Q5079743) (← links)
- Extended Static Checking by Calculation Using the Pointfree Transform (Q5191091) (← links)
- Modal Tools for Separation and Refinement (Q5403464) (← links)