Change search
ReferencesLink to record
Permanent link

Direct link
The Instruction Set for the GCLA Abstract Machine
Number of Authors: 1
1989 (English)Report (Refereed)
Abstract [en]

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

Open Access in DiVA

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

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
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