| Issue |
RAIRO-Theor. Inf. Appl.
Volume 36, Number 2, April/June 2002
Fixed Points in Computer Science (FICS'01)
|
|
|---|---|---|
| Page(s) | 155 - 180 | |
| DOI | https://doi.org/10.1051/ita:2002008 | |
| Published online | 15 December 2002 | |
Semantics of value recursion for Monadic Input/Output
1
OGI School of Science and Engineering, OHSU;
erkok@cse.ogi.edu.
2
Galois Connections, Inc.
Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell's IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper, we describe a semantics for a lazy language based on Haskell, supporting monadic I/O, mutable variables, usual recursive definitions, and value recursion. Our semantics is composed of two layers: a natural semantics for the functional layer, and a labeled transition semantics for the IO layer.
Mathematics Subject Classification: 68N18 / 68Q55 / 18C15
© EDP Sciences, 2002
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.