Witnessing side-effects

被引：2

作者：

Terauchi, T ^{[1
]}

Aiken, A

机构：

[1] Univ Calif Berkeley, Dept EECS, Berkeley, CA 94720 USA

[2] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA

来源：

ACM SIGPLAN NOTICES | 2005年 / 40卷 / 09期

关键词：

design; languages; theory; functional languages; side-effects;

D O I：

10.1145/1090189.1086379

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based on an arguably more pragmatic motivation than past approaches. We give a semantic condition for correctness and prove it is sufficient. We also give a static checking algorithm that makes use of a network flow property equivalent to the semantic condition.

引用

页码：105 / 115

页数：11

共 15 条

[1]

ACHTEN PM, 1993, P GLASG WORKSH FUNCT, P1

[2]

Boyland J, 2003, LECT NOTES COMPUT SC, V2694, P55

[3]

CRARY K, 1999, P 26 ACM SIGPLAN SIG, P262

[4]

FAHNDRICH M, 1998, P 1998 ACM SIGPLAN C, P85

[5]

GROSSMAN D, 2002, P 2002 ACM SIGPL C P

[6]

GUZMAN JC, 1990, P 5 ANN IEEE S LOG C, P42

[7]

JONES SLP, 1993, P 20 ACM SIGPLAN SIG, P71, DOI DOI 10.1145/158511.158524

[8]

LAUCHBURY J, 1993, P 20 ANN ACM SIGPLAN, P144

[9]

LAUNCHBURY J, 1997, P 2 ACM SIGPLAN INT, P227

[10] NOTIONS OF COMPUTATION AND MONADS [J].

MOGGI, E .

INFORMATION AND COMPUTATION, 1991, 93 (01) :55-92

← 1 2 →