GAM: An abstract machine for GCLA
Number of Authors: 1
1989 (English)Report (Refereed)
GCLA is a new programming language, which increases expressiveness compared with traditional logic programming languages and functional programming languages. The basis for the language 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 main idea is to extend the Warren Abstract Machine (WAM), which is an abstract machine for the language Prolog.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1989, 1. , 43 p.
SICS Research Report, ISSN 0283-3638 ; R89:02
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22188OAI: oai:DiVA.org:ri-22188DiVA: diva2:1041732
Original report number R89002.2016-10-312016-10-312017-04-07Bibliographically approved