Change search
ReferencesLink to record
Permanent link

Direct link
GAM: An abstract machine for GCLA
Number of Authors: 1
1989 (English)Report (Refereed)
Abstract [en]

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
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14376OAI: diva2:1035664
Original report number R89002.Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(4024 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 4024 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link