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} }
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.
Topics from this paper
References
SHOWING 1-10 OF 14 REFERENCES
Answer Set Programming: A Declarative Approach to Solving Search Problems
- Computer Science
- JELIA
- 2006
- 16
HILOG: A Foundation for Higher-Order Logic Programming
- Computer Science, Mathematics
- J. Log. Program.
- 1993
- 430
- PDF
Introduction to the Theory of Programming Languages
- Computer Science
- Undergraduate Topics in Computer Science
- 2011
- 2
- Highly Influential