On the relations between monadic semantics

Andrzej Filinski

doi:10.1016/j.tcs.2006.12.027

On the relations between monadic semantics

21 Citations (Scopus)

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’s original paper on the subject.

Original language	English
Journal	Theoretical Computer Science
Volume	375
Issue number	1-3
Pages (from-to)	41-75
ISSN	0304-3975
DOIs	https://doi.org/10.1016/j.tcs.2006.12.027
Publication status	Published - 2007

Access to Document

10.1016/j.tcs.2006.12.027

Cite this

@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",

}

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

SN - 0304-3975

VL - 375

SP - 41

EP - 75

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

On the relations between monadic semantics

Abstract

Access to Document

Fingerprint

Cite this