The Instruction Set for the GCLA Abstract Machine
Number of Authors: 1
1989 (English)Report (Refereed)
The basis for the language GCLA is a generalization of the concept inductive definitions, called partial inductive definitions. The program defines a logic, which is used to make inferences to prove if a query holds or not. This report first presents a short introduction to these ideas. Then, an abstract machine, called GAM, for GCLA is presented; the instructions as well as an introduction to the compiling schema is given together with some examples. The GAM instructions are also presented as transitions in an appendix.
Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1989, 1. , 99 p.
SICS Technical Report, ISSN 1100-3154 ; T89:04
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21416OAI: oai:DiVA.org:ri-21416DiVA: diva2:1041452
Original report number T89004.2016-10-312016-10-31Bibliographically approved