Abstract | ||
---|---|---|
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. |
Year | Venue | Field |
---|---|---|
2018 | WFLP | Programming language,Functional programming,Programming paradigm,Computer science,Theoretical computer science,Answer set programming,Programming Computable Functions |
DocType | Volume | Citations |
Journal | abs/1808.07770 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ingmar Dasseville | 1 | 2 | 1.07 |
Marc Denecker | 2 | 1626 | 106.40 |