Fold and unfold for program semantics

被引：0

作者：

Hutton, G ^{[1
]}

机构：

[1] Univ Nottingham, Dept Comp Sci, Languages & Programming Grp, Nottingham NG7 2RD, England

来源：

ACM SIGPLAN NOTICES | 1999年 / 34卷 / 01期

关键词：

D O I：

10.1145/291251.289457

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the dual recursion operator unfold can be used to structure operational semantics, and how algebraic properties of these operators can be used to reason about program semantics. The techniques are explained with the aid of two main examples, the first concerning arithmetic expressions, and the second concerning Milner's concurrent language CCS. The aim of the paper is to give functional programmers new insights into recursion operators, program semantics, and the relationships between them.

引用

页码：280 / 288

页数：9