(Enter summary)
Abstract: Recent work on recursion over the values of monadic actions
resulted in the introduction of a family of fixed point
operators, one for each di#erent kind of monadic e#ect. In
the context of Haskell, the function fixIO is the corresponding
operator for the IO monad. Unfortunately, both the IO
monad and fixIO are language primitives in Haskell, i.e. they
can not be defined within the language itself. Therefore, any
attempt to formally reason about fixIO is futile without a
precise semantics for... (Update)
Context of citations to this paper: More
.... for a variety of monads; the most well known examples being the functions fixIO and fixST for the internal IO and state monads of Haskell [5, 8]. Regarding the use of such looping operators, Claessen writes [3] loop combinators are unfortunate because they introduce extra...
Cited by: More
A Recursive do for Haskell - Erkök, Launchbury (2002)
(Correct)
Similar documents (at the sentence level):
15.3%: Value Recursion in Monadic Computations - Erkok (2002)
(Correct)
Active bibliography (related documents): More All
0.1: How to Declare an Imperative - Wadler (1995)
(Correct)
0.1: Traced Premonoidal Categories - Benton, Hyland (1999)
(Correct)
0.1: Recursion is a Computational Effect - Friedman, Sabry (2000)
(Correct)
Similar documents based on text: More All
0.5: Recursive Monadic Bindings - Erkok, Launchbury (2000)
(Correct)
0.4: A Monad of Imperative Streams - Scholz (1996)
(Correct)
0.4: Concurrent Haskell - Jones, Gordon, Finne (1996)
(Correct)
BibTeX entry: (Update)
ERK OK, L., LAUNCHBURY, J., AND MORAN, A. Semantics of fixIO. In Fixed Points in Computer Science Workshop, FICS'01 (September 2001). http://citeseer.ist.psu.edu/588943.html More
@misc{ ok01semantics,
author = "E. OK and L. LAUNCHBURY and J. MORAN",
title = "Semantics of fixIO",
text = "ERK OK, L., LAUNCHBURY, J., AND MORAN, A. Semantics of fixIO. In Fixed
Points in Computer Science Workshop, FICS'01 (September 2001).",
year = "2001",
url = "citeseer.ist.psu.edu/588943.html" }
Citations (may not include all citations):
244
Imperative functional programming
- Jones, Wadler - 1993
178
Communicating and Mobile Systems: the #-Calculus (context) - Milner - 1999
114
A natural semantics for lazy evaluation
- Launchbury - 1993
77
Lisp and Symbolic Computation (context) - Launchbury, Peyton - 1995
30
Distinguished Dissertations in Computer Science (context) - Gordon - 1994
28
Asynchronous exceptions in haskell
- Marlow, Peyton et al. - 2001
20
Tackling awkward squad monadic inputoutput
- Tackling, squad et al. - 2001
15
Porting the Clean Object I/O Library to Haskell (context) - Achten, Peyton - 2000
15
On embedding a microarchitectural design language within Has..
- Launchbury, Lewis et al. - 1999
13
Recursive monadic bindings (context) - ok, Launchbury - 2000
8
a nonstrict purely-functional programming language (context) - Jones, Hughes et al. - 1999
8
Reactive Objects and Functional Programming (context) - Nordlander - 1999
3
A recursive do for Haskell: Design and implementation (context) - ok, Launchbury - 2000
Documents on the same site (http://cse.cse.ogi.edu/PacSoft/publications/bibliograph.html): More
Type Classes with Functional Dependencies - Jones (2000)
(Correct)
Typing Haskell in Haskell - Jones (1999)
(Correct)
A Recursive do for Haskell: Design and Implementation - Erkok, al. (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC