Completeness of context-sensitive rewriting

DOI10.1016/J.IPL.2014.07.004zbMath1302.68144OpenAlexW2059589881MaRDI QIDQ477588

Salvador Lucas

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/64906

zbMATH Keywords

programming languagesalgebraic semanticsformal reasoningcontext-sensitive rewriting

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting

Uses Software

• CafeOBJ
• Maude

Cites Work

• Unnamed Item
• Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Context-sensitive rewriting strategies
• On the Completeness of Context-Sensitive Order-Sorted Specifications

This page was built for publication: Completeness of context-sensitive rewriting