RAIRO-Theor. Inf. Appl.
Volume 38, Number 4, October-December 2004Fixed Points in Computer Science (FICS'03)
|Page(s)||375 - 400|
|Published online||15 October 2004|
An abstract monadic semantics for value recursion
DISI, Universitá di Genova, Italy; email@example.com.
2 Departement of Computer Science, Indiana University, USA; firstname.lastname@example.org.
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.