On the relations between monadic semantics

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

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 375; no. 1; pp. 41 - 75
Main Author Filinski, Andrzej
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2007
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computational metalanguage
Computer science; control theory; systems
Continuations
Exact sciences and technology
Language theory and syntactical analysis
Logical relations
Monads
Recursive types
Theoretical computing
Monads
Recursive types
Computational metalanguage
Logical relations
Continuations
Functional language
Semantic relation
Computer theory
Interpretation
Logical relation
Denotational semantics
Variety
Monad
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2006.12.027