SODA

GAM: An abstract machine for GCLA

Aronsson, Martin (1989) GAM: An abstract machine for GCLA. [SICS Report]

[img]
Preview
PDF
4023Kb

Abstract

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.

Item Type:SICS Report
Additional Information:Original report number R89002.
ID Code:2526
Deposited By:Vicki Carleson
Deposited On:28 Sep 2009
Last Modified:18 Nov 2009 16:10

Repository Staff Only: item control page