scientific article; zbMATH DE number 910715
From MaRDI portal
Publication:4885873
Recommendations
Cited in
(28)- Point-free calculational proofs and program derivation in linear algebra using a graphical syntax
- scientific article; zbMATH DE number 2090016 (Why is no real title available?)
- Essential concepts of algebraic specification and program development
- Constructive Galois connections
- Diagrammatic algebra of first order logic
- Program calculation in Coq
- Final Dialgebras: From Categories to Allegories
- A compositional framework for developing parallel programs on two-dimensional arrays
- Assertions and recursions
- scientific article; zbMATH DE number 2087346 (Why is no real title available?)
- Provably correct derivation of algorithms using FermaT
- Transformational programming and the paragraph problem
- Partiality. II: Constructed relation algebras
- Datatype-generic termination proofs
- Preface
- Program algebras of recursive functions
- When Lawvere meets Peirce: an equational presentation of Boolean hyperdoctrines
- How to prove decidability of equational theories with second-order computation analyser SOL
- Filter-embedding semiring fusion for programming with MapReduce
- scientific article; zbMATH DE number 1390330 (Why is no real title available?)
- Characteristics of structurally finite classes of order-preserving three-valued logic maps
- scientific article; zbMATH DE number 7779293 (Why is no real title available?)
- scientific article; zbMATH DE number 3936467 (Why is no real title available?)
- On Automating the Calculus of Relations
- Towards patterns for heaps and imperative lambdas
- Generic functional programming with types and relations
- scientific article; zbMATH DE number 2087344 (Why is no real title available?)
- Relations as executable specifications: taming partiality and non-determinism using invariants
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 Q4885873)
