liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Logic programming with external procedures: an implementation
Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
1992 (Engelska)Licentiatavhandling, monografi (Övrigt vetenskapligt)
Abstract [en]

This work aims at combining logic programs with functions written in other languages, such that the combination preserves the declarative semantics of the logic program. S-Unification, as defined by S. Bonnier and J. Maluszynski, provides a theoretical foundation for this.

- This thesis presents a definition and an implementation of a logic programming language, GAPLog, that uses S-unification to integrate Horn clauses with external functional procedures. The implementation is described as a scheme that translates GAPLog programs to Prolog. In particular, a call to an external function is transformed to a piece of Prolog code that will delay the call until all arguments are ground. The scheme produces reasonably efficient code if Prolog supports efficient coroutining. S-unification will cause no overhead if there are no function calls in the program.

- If the arguments are ground whenever a function call is reached in the execution process, then the dynamic check for groundness is unnecessary. To avoid the overhead caused by the groundness check a restriction of GAPLog is described, called Ground GAPLog, where the groundness of function calls is guaranteed. The restrictions are derived from the language Ground Prolog defined by F. Kluzniak. Many of the results for Ground Prolog also apply for Ground GAPLog. They indicate that Ground GAPLog is suitable for compilation to very efficient code.

Ort, förlag, år, upplaga, sidor
Linköping: Univ. , 1992. , s. 86
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 326
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-163138Lokalt ID: LiU-Tek-Lic-1992:18ISBN: 9178709679 (tryckt)OAI: oai:DiVA.org:liu-163138DiVA, id: diva2:1385758
Tillgänglig från: 2020-01-15 Skapad: 2020-01-15 Senast uppdaterad: 2020-01-24Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Sök vidare i DiVA

Av författaren/redaktören
Kågedal, Andreas
Av organisationen
Institutionen för datavetenskapTekniska högskolan
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 6 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf