NOTIONS OF COMPUTATION AND MONADS

被引：842

作者：

MOGGI, E

机构：

[1] Department of Computer Science, University of Edinburgh, Edinburgh

来源：

INFORMATION AND COMPUTATION | 1991年 / 93卷 / 01期

关键词：

723 Computer Software; Data Handling and Applications;

D O I：

10.1016/0890-5401(91)90052-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with λ-terms. However, if one goes further and uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from values to values) that may jeopardise the applicability of theoretical results. In this paper we introduce calculi, based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation. © 1991.

引用

页码：55 / 92

页数：38