Search

• < Previous
• 1
• Next >

Untyping Typed Algebras and Colouring Cyclic Linear Logic

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to&nbsp;[&hellip;]