Run-time type computations in the Warren Abstract machine
- 28 February 1994
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 18 (2) , 123-148
- https://doi.org/10.1016/0743-1066(94)90049-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Correctness proof for the WAM with typesPublished by Springer Nature ,2005
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- An order-sorted logic for knowledge representation systemsArtificial Intelligence, 1992
- Logic programming with typed unification and its realization on an abstract machineIBM Journal of Research and Development, 1992
- Horn clause programs with polymorphic types: semantics and resolutionTheoretical Computer Science, 1991
- A polymorphic type system with subtypes for PrologPublished by Springer Nature ,1988
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- A polymorphic type system for prologArtificial Intelligence, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982