NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1) , 114-135
- https://doi.org/10.1137/0222010
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sequentiality in orthogonal term rewriting systemsJournal of Symbolic Computation, 1991
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systemsInformation and Computation, 1990
- Functional Programming and Lambda CalculusPublished by Elsevier ,1990
- A refinement of strong sequentiality for term rewriting with constructorsInformation and Computation, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979
- Computing in systems described by equationsLecture Notes in Computer Science, 1977
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970