arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.07770cs.PL
收藏

将可编程可计算函数转换为应答集程序

Transpiling Programmable Computable Functions to Answer Set Programs

Ingmar Dasseville, Marc Denecker

摘要:

可计算函数编程(PCF)是一种简化的程序设计语言,它为现代函数式程序设计语言提供了理论基础。答案集编程(ASP)是一种专注于解决搜索问题的编程范式。在本文中,我们提供了一个从PCF到ASP的翻译。通过这种转换,可以使用PCF指定搜索问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑