A PROLOG environment for developing and reasoning about data types
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 276-293
- https://doi.org/10.1007/3-540-15199-0_18
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Prolog technology theorem proverNew Generation Computing, 1984
- The occur-check problem in PrologNew Generation Computing, 1984
- Associative-Commutative UnificationPublished by Springer Nature ,1984
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Algebraic theory of parameterized specifications with requirementsLecture Notes in Computer Science, 1981
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Canonical Forms and Unification.Published by Defense Technical Information Center (DTIC) ,1980
- Expressiveness of the operation set of a data abstractionPublished by Association for Computing Machinery (ACM) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- The algebraic specification of abstract data typesActa Informatica, 1978