A rationale for conditional equational programming
- 31 December 1990
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 75 (1-2) , 111-138
- https://doi.org/10.1016/0304-3975(90)90064-o
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (DCR 8513417)
- Natural Sciences and Engineering Research Council of Canada (ICR92599, OGP36663)
- Fonds pour la Formation de Chercheurs et l'Aide à la Recherche (410-88-884, EQ41840, NC0025)
This publication has 17 references indexed in Scilit:
- An implementation of narrowingThe Journal of Logic Programming, 1989
- Note on a Proof of the Extended Kirby—Paris Theorem on Labeled Finite TreesEuropean Journal of Combinatorics, 1988
- The relation between logic and functional languages: a surveyThe Journal of Logic Programming, 1986
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- Oriented equational clauses as a programming languageThe Journal of Logic Programming, 1984
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967