uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • 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
Towards a logic programming methodology based on higher-order predicates
Uppsala University, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science.
1997 (English)In: NEW GENERATION COMPUTING, ISSN 0288-3635, Vol. 15, no 4, 421-447 p.Article in journal (Refereed) Published
Abstract [en]

This paper outlines a logic programming methodology which applies standardized logic program recursion forms afforded by a system of general purpose recursion schemes. The recursion schemes are conceived of as quasi higher-order predicates which accept pr

Place, publisher, year, edition, pages
SPRINGER VERLAG , 1997. Vol. 15, no 4, 421-447 p.
Keyword [en]
higher-order and metalogic programming; recursion schemes; composition; parameterization; and modularization of logic programs
Identifiers
URN: urn:nbn:se:uu:diva-27174OAI: oai:DiVA.org:uu-27174DiVA: diva2:55068
Note
Addresses: Hamfelt A, UNIV UPPSALA, DEPT COMP SCI, BOX 311, S-75105 UPPSALA, SWEDEN. TECH UNIV DENMARK, DEPT INFORMAT TECHNOL, DK-2800 LYNGBY, DENMARK.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Department of Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 325 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • 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