Equality, types, modules, and (why not?) generics for logic programming
- 31 August 1984
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 1 (2), 179-210
- https://doi.org/10.1016/0743-1066(84)90004-9
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Incremental construction of unification algorithms in equational theoriesPublished by Springer Nature ,2006
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Logic for problem solvingACM SIGSOFT Software Engineering Notes, 1982
- Programming with EquationsACM Transactions on Programming Languages and Systems, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- Logic programming and compiler writingSoftware: Practice and Experience, 1980
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965