Proving termination of GHC programs
- 1 September 1997
- journal article
- research article
- Published by Springer Nature in New Generation Computing
- Vol. 15 (3) , 293-338
- https://doi.org/10.1007/bf03037949
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Sequentialization of parallel logic programs with mode analysisPublished by Springer Nature ,1993
- Communication with directed logic variablesPublished by Association for Computing Machinery (ACM) ,1991
- The family of concurrent logic programming languagesACM Computing Surveys, 1989
- An overview of Rewrite Rule Laboratory (RRL)Lecture Notes in Computer Science, 1989
- Simulation of Turing machines by a left-linear rewrite rulePublished by Springer Nature ,1989
- Unfolding rules for GHC programsNew Generation Computing, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- On the Development of Reactive SystemsPublished by Springer Nature ,1985
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982