Typing theorems of omega algebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1612485 (Why is no real title available?)
- scientific article; zbMATH DE number 4210141 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 1086628 (Why is no real title available?)
- scientific article; zbMATH DE number 1984270 (Why is no real title available?)
- scientific article; zbMATH DE number 814823 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- A first-order calculus for allegories
- An efficient Coq tactic for deciding Kleene algebras
- Dependently-typed formalisation of relation-algebraic abstractions
- Partial, total and general correctness
- RALL: machine-supported proofs for relation algebra
- Relational Methods in Computer Science
- Relational and Kleene-Algebraic Methods in Computer Science
- Towards a typed omega algebra
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Cited in
(4)
This page was built for publication: Typing theorems of omega algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931900)