Notions of Computation and Monads-英文文献.pdfVIP

INFORMATION AND COMPUTATION 93, 55-92 ( 1991) Notions of Computation and Monads EUGENIO MOGGI* Department of Computer Science, Unirersity of Edinburgh, Edinburgh EN9 352, UK The i.-calculus is considered a useful mathematical tool in the study of program- ming languages, since programs can be identified with I-terms. However, if one goes further and uses bn-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from calues 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. :i’: 199 I Academic Press. Inc. INTRODUCTION This paper is about logics for reasoning about programs, in particular for proving equivalence of programs. Following a consolidated tradition in theoretical computer science we identify programs with the closed A-terms, possibly containing extra constants, corresponding to some features of the programming language under consideration. There are three semantics- based approaches to proving equivalence of programs: l The operational approach starts from an operational semantics, e.g., a partial function mapping every program (i.e., closed term) to its