Aronsson, Martin (1989) The Instruction Set for the GCLA Abstract Machine. [SICS Report]
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.
|Item Type:||SICS Report|
|Additional Information:||Original report number T89004.|
|Deposited By:||Vicki Carleson|
|Deposited On:||29 Oct 2007|
|Last Modified:||18 Nov 2009 16:00|
Repository Staff Only: item control page