Typing theorems of omega algebra

DOI10.1016/j.jlap.2012.05.002zbMath1279.68237OpenAlexW1995311694WikidataQ114851544 ScholiaQ114851544MaRDI QIDQ1931900

Walter Guttmann

Publication date: 16 January 2013

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2012.05.002

zbMATH Keywords

matrix algebraKleene algebraheterogeneous relationsomega algebranon-square matrices1-free expressiontyped omega algebratyping theorems

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Uses Software

• RALL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A completeness theorem for Kleene algebras and the algebra of regular events
• A First-Order Calculus for Allegories
• Towards a Typed Omega Algebra
• Dependently-Typed Formalisation of Relation-Algebraic Abstractions
• Partial, Total and General Correctness
• Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
• RALL: Machine-supported proofs for relation algebra
• Relational and Kleene-Algebraic Methods in Computer Science
• An Efficient Coq Tactic for Deciding Kleene Algebras
• Relational Methods in Computer Science

This page was built for publication: Typing theorems of omega algebra