by Christoph Beierle, Egon Borger, Fachbereich Informatik, Fernuniversitat Hagen, D- Hagen
http://bigfoot.eecs.umich.edu/.1/groups/Ealgebras/pam2.ps.gz
Add To MetaCart
Abstract:
slightly modified version appeared in:
Citations
| 448 | An abstract Prolog instruction set – Warren |
| 192 | Warren’s Abstract Machine: A Tutorial Reconstruction – Ait-Kaci - 1991 |
| 134 | A polymorphic type system for Prolog – Mycroft, O'Keefe - 1984 |
| 66 | The WAM -- Definition and Compiler Correctness – Borger, Rosenzweig - 1995 |
| 61 | Logic Programming over Polymorphically Order-Sorted Types – Smolka - 1989 |
| 37 | clause programs with polymorphic types: semantics and resolution – Horn - 1991 |
| 27 | A logical operational semantics of full Prolog. Part I: Selection core and control – Borger - 1990 |
| 10 | Run-time type computations in the warren abstract machine – Beierle, Meyer - 1994 |
| 9 | Specification and correctness proof of a WAM extension with abstract type constraints – Beierle, Börger - 1996 |
| 9 | Logic programming with typed unification and its realization on an abstract machine – Beierle - 1992 |
| 8 | TEL (version 0.9), Report and User – Smolka - 1988 |

