Witnessing side-effects

Tachio Terauchi; Alex Aiken

doi:10.1145/1090189.1086379

Witnessing side-effects

Tachio Terauchi, Alex Aiken

Research output: Contribution to journal › Article

7 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	105-115
Number of pages	11
Journal	ACM SIGPLAN Notices
Volume	40
Issue number	9
DOIs	https://doi.org/10.1145/1090189.1086379
Publication status	Published - 2005
Externally published	Yes

Fingerprint

Keywords

Functional languages
Side-effects

ASJC Scopus subject areas

Computer Science(all)

Cite this

Terauchi, T., & Aiken, A. (2005). Witnessing side-effects. ACM SIGPLAN Notices, 40(9), 105-115. https://doi.org/10.1145/1090189.1086379

@article{1bb11144fbd54b9daba370f948fdd3b2,

title = "Witnessing side-effects",

abstract = "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.",

keywords = "Functional languages, Side-effects",

author = "Tachio Terauchi and Alex Aiken",

year = "2005",

doi = "10.1145/1090189.1086379",

language = "English",

volume = "40",

pages = "105--115",

journal = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)",

issn = "0362-1340",

publisher = "Association for Computing Machinery (ACM)",

number = "9",

}

TY - JOUR

T1 - Witnessing side-effects

AU - Terauchi, Tachio

AU - Aiken, Alex

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Functional languages

KW - Side-effects

UR - http://www.scopus.com/inward/record.url?scp=33745201221&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745201221&partnerID=8YFLogxK

U2 - 10.1145/1090189.1086379

DO - 10.1145/1090189.1086379

M3 - Article

AN - SCOPUS:33745201221

VL - 40

SP - 105

EP - 115

JO - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

JF - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

SN - 0362-1340

IS - 9

ER -

Access to Document

10.1145/1090189.1086379