On the relations between monadic semantics

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

On the relations between monadic semantics. / Filinski, Andrzej.

In: Theoretical Computer Science, Vol. 375, No. 1-3, 2007, p. 41-75.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Filinski, A 2007, 'On the relations between monadic semantics', Theoretical Computer Science, vol. 375, no. 1-3, pp. 41-75. https://doi.org/10.1016/j.tcs.2006.12.027

APA

Filinski, A. (2007). On the relations between monadic semantics. Theoretical Computer Science, 375(1-3), 41-75. https://doi.org/10.1016/j.tcs.2006.12.027

Vancouver

Filinski A. On the relations between monadic semantics. Theoretical Computer Science. 2007;375(1-3):41-75. https://doi.org/10.1016/j.tcs.2006.12.027

Author

Filinski, Andrzej. / On the relations between monadic semantics. In: Theoretical Computer Science. 2007 ; Vol. 375, No. 1-3. pp. 41-75.

Bibtex

@article{86d01f1065b311dcbee902004c4f4f50,
title = "On the relations between monadic semantics",
abstract = "We present a simple computational metalanguage with general recursive types and multiple notions of effects, through which a variety of concrete denotational semantics can be conveniently factored, by suitably interpreting the effects as monads. We then propose a methodology for relating two such interpretations of the metalanguage, with the aim of showing that the semantics they induce agree for complete programs. As a prototypical instance of such a relation, we use the framework to show agreement between a direct and a continuation semantics of the simple, untyped functional language from Reynolds{\textquoteright}s original paper on the subject.",
author = "Andrzej Filinski",
year = "2007",
doi = "10.1016/j.tcs.2006.12.027",
language = "English",
volume = "375",
pages = "41--75",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

RIS

TY - JOUR

T1 - On the relations between monadic semantics

AU - Filinski, Andrzej

PY - 2007

Y1 - 2007

N2 - We present a simple computational metalanguage with general recursive types and multiple notions of effects, through which a variety of concrete denotational semantics can be conveniently factored, by suitably interpreting the effects as monads. We then propose a methodology for relating two such interpretations of the metalanguage, with the aim of showing that the semantics they induce agree for complete programs. As a prototypical instance of such a relation, we use the framework to show agreement between a direct and a continuation semantics of the simple, untyped functional language from Reynolds’s original paper on the subject.

AB - We present a simple computational metalanguage with general recursive types and multiple notions of effects, through which a variety of concrete denotational semantics can be conveniently factored, by suitably interpreting the effects as monads. We then propose a methodology for relating two such interpretations of the metalanguage, with the aim of showing that the semantics they induce agree for complete programs. As a prototypical instance of such a relation, we use the framework to show agreement between a direct and a continuation semantics of the simple, untyped functional language from Reynolds’s original paper on the subject.

U2 - 10.1016/j.tcs.2006.12.027

DO - 10.1016/j.tcs.2006.12.027

M3 - Journal article

VL - 375

SP - 41

EP - 75

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -

ID: 1050055