Strong and NV-sequentiality of constructor systems

DOI10.1016/J.IPL.2003.11.006zbMath1176.68097OpenAlexW1964852933MaRDI QIDQ1029079

Salvador Lucas

Publication date: 9 July 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.006

zbMATH Keywords

programming languagesterm rewritingsequentialitystrategies

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly sequential and inductively sequential term rewriting systems
• Root-neededness and approximations of neededness
• Sequentiality in orthogonal term rewriting systems
• Maude: specification and programming in rewriting logic
• Sequentiality, monadic second-order logic and tree automata.
• Context-sensitive rewriting strategies
• Bounded, strongly sequential and forward-branching term rewriting systems
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Classes of equational programs that compile into efficient machine code
• Decidable approximations of term rewriting systems
• Decidable call by need computations in term rewriting (extended abstract)

This page was built for publication: Strong and NV-sequentiality of constructor systems