The following pages link to (Q4885873):
Displaying 15 items.
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Datatype-generic termination proofs (Q1015386) (← links)
- Partiality. II: Constructed relation algebras (Q1931901) (← links)
- Filter-embedding semiring fusion for programming with MapReduce (Q1941877) (← links)
- Towards patterns for heaps and imperative lambdas (Q2374314) (← links)
- A compositional framework for developing parallel programs on two-dimensional arrays (Q2460097) (← links)
- Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants (Q2915141) (← links)
- Program Calculation in Coq (Q3067474) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- Assertions and recursions (Q4645810) (← links)
- Generic functional programming with types and relations (Q4880524) (← links)
- Final Dialgebras: From Categories to Allegories (Q4943551) (← links)
- Constructive Galois Connections (Q4972068) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- Preface (Q5970649) (← links)
