Total Functional Programming
Total Functional Programming
复制标题
全函数式编程
DOI：
10.3217/jucs-010-07-0751
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
D. A. Turner
中科院分区：
文献类型：
--
作者：
D. A. Turner
函数式编程的驱动思想是使编程与数学更加紧密地联系在一起。Haskell 或 Miranda 等函数式语言的程序由等式组成，这些等式既是计算规则，也是对其定义的函数和数据结构进行简单代数推理的基础。现有的函数式编程模型虽然优雅而强大，但由于部分函数的存在而受到的损害比人们通常认识到的要大得多。我们考虑了一种简单的全函数式编程方法，旨在排除非终结的可能性。除其他事项外，这还要求对有限的数据和潜在无限的代码数据进行类型区分。
The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recognised by the presence of partial functions. We consider a simple discipline of total functional programming designed to exclude the possibility of non-termination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite.