Witnessing side-effects

Tachio Terauchi, Alex Aiken

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 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 languageEnglish
Title of host publicationICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming
Pages105-115
Number of pages11
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005 - Tallinn, Estonia
Duration: 2005 Sep 262005 Sep 28

Other

Other10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005
CountryEstonia
CityTallinn
Period05/9/2605/9/28

Fingerprint

Semantics

Keywords

  • Functional languages
  • Side-effects

ASJC Scopus subject areas

  • Software

Cite this

Terauchi, T., & Aiken, A. (2005). Witnessing side-effects. In ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming (pp. 105-115) https://doi.org/10.1145/1086365.1086379

Witnessing side-effects. / Terauchi, Tachio; Aiken, Alex.

ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming. 2005. p. 105-115.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Terauchi, T & Aiken, A 2005, Witnessing side-effects. in ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming. pp. 105-115, 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, 05/9/26. https://doi.org/10.1145/1086365.1086379
Terauchi T, Aiken A. Witnessing side-effects. In ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming. 2005. p. 105-115 https://doi.org/10.1145/1086365.1086379
Terauchi, Tachio ; Aiken, Alex. / Witnessing side-effects. ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming. 2005. pp. 105-115
@inproceedings{80501597f9384dc6a95932c380526fab,
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/1086365.1086379",
language = "English",
isbn = "1595930647",
pages = "105--115",
booktitle = "ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming",

}

TY - GEN

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=33750414626&partnerID=8YFLogxK

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

U2 - 10.1145/1086365.1086379

DO - 10.1145/1086365.1086379

M3 - Conference contribution

AN - SCOPUS:33750414626

SN - 1595930647

SN - 9781595930644

SP - 105

EP - 115

BT - ICFP 2005 - Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming

ER -