Semantic labelling for proving termination of combinatory reduction systems

DOI10.1007/978-3-642-11999-6_5MaRDI QIDQ3557095zbMATH OpenOpenAlexFDO

Authors Makoto Hamana

Publication date 27 April 2010

Published in Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11999-6_5

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 794240
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• scientific article; zbMATH DE number 1670496
• scientific article; zbMATH DE number 2185672
• Innermost termination of rewrite systems by labeling

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
• scientific article; zbMATH DE number 2185672 (Why is no real title available?)
• 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
• Term Rewriting and Applications

Describes a project that uses

Uses Software

• GHC

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)