Predicate Specialization for Definitional Higher-order Logic Programs release_ijmtfxjsxbdxrlgr7wxr5ytv24

by Antonis Troumpoukis, Angelos Charalambidis

Released as a report .

2018  

Abstract

Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates typically occur. Higher-order characteristics are indeed desirable but on the other hand they are also usually more expensive to support. In this paper we propose a program specialization technique based on partial evaluation that can be applied to a modest but useful class of higher-order logic programs and can transform them into first-order programs without introducing additional data structures. The resulting first-order programs can be executed by conventional logic programming interpreters and benefit from other optimizations that might be available. We provide an implementation and experimental results that suggest the efficiency of the transformation.
In text/plain format

Archived Files and Locations

application/pdf  203.4 kB
file_ix6dakjqsnhvnbersdll4wjtve
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  report
Stage   submitted
Date   2018-08-13
Version   v1
Language   en ?
Number  LOPSTR/2018/11
arXiv  1808.04176v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4a1e621d-2c72-42fe-a214-70364212699d
API URL: JSON