Verifying the unification algorithm in LCF
- 1 January 1985
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 5, 143-169
- https://doi.org/10.1016/0167-6423(85)90009-7
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Constructive Mathematics and Computer ProgrammingPublished by Elsevier ,2014
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Synthesis of a unification algorithm in a logic programming calculusThe Journal of Logic Programming, 1984
- A Mechanical Proof of the Turing Completeness of Pure LispContemporary Mathematics, 1984
- The Equivalence of Two Semantic Definitions: A Case Study in LCFSIAM Journal on Computing, 1983
- Deductive synthesis of the unification algorithmScience of Computer Programming, 1981
- Edinburgh LCFLecture Notes in Computer Science, 1979
- A Computational LogicPublished by Elsevier ,1979
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969
- On the recursive programming techniquesCommunications of the ACM, 1964