Point-free calculational proofs and program derivation in linear algebra using a graphical syntax
From MaRDI portal
Cites work
- A categorical semantics of signal flow graphs
- A survey of graphical languages for monoidal categories
- AN ALGEBRA OF ADDITIVE RELATIONS
- Cartesian bicategories. I
- Categories in control
- Extended echelon form and four subspaces
- Extension theory of formally normal and symmetric subspaces
- Full abstraction for signal flow graphs
- Graphical affine algebra
- scientific article; zbMATH DE number 2125662 (Why is no real title available?)
- scientific article; zbMATH DE number 1183904 (Why is no real title available?)
- scientific article; zbMATH DE number 1065062 (Why is no real title available?)
- scientific article; zbMATH DE number 910715 (Why is no real title available?)
- Interacting Hopf algebras
- Introducing String Diagrams
- Operational calculus of linear relations
- Point-free, set-free concrete linear algebra
- Primer of linear algebra and analytic geometry. The essentials in detail, for teacher and bachelor students. With the collaboration of Florian Quiring
- Programming from metaphorisms
- Refinement for signal flow graphs
- Towards a compositional framework for convex analysis (with applications to probability theory)
- Two algorithms for the exchange lemma
This page was built for publication: Point-free calculational proofs and program derivation in linear algebra using a graphical syntax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946028)