Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Compositional Relational Programming with Name Projection and Compositional Synthesis
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media.ORCID iD: 0000-0001-5213-8253
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media, Information Systems.
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media, Information Systems.
2017 (English)In: Perspectives of System Informatics: 11th International Andrei P. Ershov Informatics Conference, PSI 2017, Moscow, Russia, June 26-29, 2017, Revised Selected Papers, Springer, 2017Conference paper, Published paper (Refereed)
Abstract [en]

CombInduce is a methodology for inductive synthesis of logic programs, which employs a reversible meta-interpreter for synthesis, and uses a compositional relational target language for ecient synthesis of recursive predicates.

The target language, Combilog, has reduced usability due to the lack of variables, a feature enforced by the principle of compositionality, which is at the core of the synthesis process. We present a revision of Combilog, namely, Combilog with Name Projection (CNP), which brings improved usability by using argument names, whilst still staying devoid of variables, preserving the compositionality.

Place, publisher, year, edition, pages
Springer, 2017.
Series
Lecture Notes in Computer Science ; 10742
Keywords [en]
Logic programming, program synthesis, relational programming, programming languages, compositional programming, meta-programming, meta-interpreter
National Category
Information Systems
Research subject
Information Systems
Identifiers
URN: urn:nbn:se:uu:diva-337285OAI: oai:DiVA.org:uu-337285DiVA, id: diva2:1168847
Conference
A.P. Ershov Informatics Conference (the PSI Conference Series, 11th edition)
Available from: 2017-12-21 Created: 2017-12-21 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(351 kB)28 downloads
File information
File name FULLTEXT01.pdfFile size 351 kBChecksum SHA-512
405bc0cace67409c4871c6e569d06565e6c31057e4a9c5ce6973b44d74f48493fbaa3f181b1f9438fd06ed1841edcadfb4cb3fa38ae12642fcfa9161199983fb
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Paçacı, GörkemMcKeever, SteveHamfelt, Andreas
By organisation
Department of Informatics and MediaInformation Systems
Information Systems

Search outside of DiVA

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

urn-nbn

Altmetric score

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

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