Semantic labelling for proving termination of combinatory reduction systems
From MaRDI portal
Recommendations
Cited in
(8)- Theory and practice of second-order rewriting: foundation, evolution, and SOL
- A compositional proof system on a category of labelled transition systems
- Strict functionals for termination proofs
- On the Relation between Sized-Types Based Termination and Semantic Labelling
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- How to prove decidability of equational theories with second-order computation analyser SOL
- Algebra and Coalgebra in Computer Science
- Universal algebra for termination of higher-order rewriting
This page was built for publication: Semantic labelling for proving termination of combinatory reduction systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557095)