|
|||||||||||||||
Theoret. Informatics Appl. 38, 375-400 (2004)
DOI: 10.1051/ita:2004018
An abstract monadic semantics for value recursion
Eugenio Moggi1 and Amr Sabry21 DISI, Universitá di Genova, Italy; moggi@disi.unige.it.
2 Departement of Computer Science, Indiana University, USA; sabry@indiana.edu.
Abstract
This paper proposes an operational semantics for value recursion in
the context of monadic metalanguages. Our technique for combining
value recursion with computational effects works uniformly for
all monads.
The operational nature of our approach is related to the
implementation of recursion in Scheme and its monadic version proposed
by Friedman and Sabry, but it defines a different semantics and does
not rely on assignments. When contrasted to the axiomatic approach
proposed by Erkök and Launchbury, our semantics for the continuation
monad invalidates one of the axioms, adding to the evidence that this
axiom is problematic in the presence of continuations.
Mathematics Subject Classification. 68N18, 68Q55.
© EDP Sciences 2004
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook