Transpiling Programmable Computable Functions to Answer Set Programs

@article{Dasseville2018TranspilingPC,
  title={Transpiling Programmable Computable Functions to Answer Set Programs},
  author={Ingmar Dasseville and M. Denecker},
  journal={ArXiv},
  year={2018},
  volume={abs/1808.07770}
}
  • Ingmar Dasseville, M. Denecker
  • Published 2018
  • Computer Science
  • ArXiv
  • Programming Computable Functions (PCF) is a simplified programming language which provides the theoretical basis of modern functional programming languages. Answer set programming (ASP) is a programming paradigm focused on solving search problems. In this paper we provide a translation from PCF to ASP. Using this translation it becomes possible to specify search problems using PCF. 

    References

    SHOWING 1-10 OF 14 REFERENCES
    Enhancing answer set programming with templates
    • 27
    • PDF
    Answer Set Programming: A Declarative Approach to Solving Search Problems
    • 16
    HILOG: A Foundation for Higher-Order Logic Programming
    • 430
    • PDF
    ASP-Core-2 Input Language Format
    • 94
    • PDF
    Introduction to the Theory of Programming Languages
    • 2
    • Highly Influential
    Grounding and Solving in Answer Set Programming
    • 55
    • PDF
    LCF Considered as a Programming Language
    • 1,160
    • PDF
    Mechanized Verification of CPS Transformations
    • 35
    • PDF
    Magic is relevant
    • 128
    Answer set programming at a glance
    • 650