Purely Functional Monadic Scheme

Published on June, 2004

Information

Martin Grabmüller: Purely Functional Monadic Scheme, draft paper, June 2004.

8 pages, A4 format, English.

Abstract

This paper describes a purely functional dialect of the algorithmic programming language Scheme. Mutable variables, assignment operations and impure control operations (call-with-current-continuation) have been omitted, while side effecting input and output operations are incorporated into the purely functional language using monads, similar to the approach taken in the lazy programming language Haskell.

Download

This article is available electronically: [ PDF ]

BibTeX Entry

@Unpublished{Grabmueller2004MonadicScheme,
  author =	 {Martin Grabm{\"u}ller},
  title =	 {{Purely Functional Monadic Scheme}},
  note =	 {Draft paper},
  month =	 {June},
  year =	 2004,
  abstract =	 {This paper describes a purely functional dialect of
                  the algorithmic programming language Scheme. Mutable
                  variables, assignment operations and impure control
                  operations (call-with-current-continuation) have
                  been omitted, while side effecting input and output
                  operations are incorporated into the purely
                  functional language using monads, similar to the
                  approach taken in the lazy programming language
                  Haskell.}
}