liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Logic programming with external procedures: an implementation
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
1992 (English)Licentiate thesis, monograph (Other academic)
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.

Place, publisher, year, edition, pages
Linköping: Univ. , 1992. , p. 86
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 326
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-163138Local ID: LiU-Tek-Lic-1992:18ISBN: 9178709679 (print)OAI: oai:DiVA.org:liu-163138DiVA, id: diva2:1385758
Available from: 2020-01-15 Created: 2020-01-15 Last updated: 2020-01-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Kågedal, Andreas
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 2 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf