This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required. Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exceptions, state, and continuations; and also provide effects not easily achieved with such features. The types of a program reflect which effects occur. The first section is an extended example of the use of monads. A simple interpreter is modified to support various extra features: error messages, state, output, and non-deterministic choice. The second section describes the relation between monads and continuation-passing style. The third section sketches how monads are used in a compiler for Hask...
. A monad for concurrent programming that is suitable for being built into Haskell is presented. The...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop...
This paper explores the use monads to structure functional programs. No prior knowledge of monads or...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
We present a detailed examination of applications of category theory to functional programming lang...
We present a detailed examination of applications of category theory to functional programming lang...
Abstract. Monads are a technique widely used in functional program-ming languages to address many di...
Abstract. This paper describes a purely functional dialect of the algorithmic programming language S...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
In functional programming, a popular approach to building recursive descent parsers is to model pars...
The structure of monadic functional programs allows the integration of many different features by ju...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop...
A monad is presented which is suitable for writing concurrent programs in a purely functional progra...
. A monad for concurrent programming that is suitable for being built into Haskell is presented. The...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop...
This paper explores the use monads to structure functional programs. No prior knowledge of monads or...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
We present a detailed examination of applications of category theory to functional programming lang...
We present a detailed examination of applications of category theory to functional programming lang...
Abstract. Monads are a technique widely used in functional program-ming languages to address many di...
Abstract. This paper describes a purely functional dialect of the algorithmic programming language S...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
In functional programming, a popular approach to building recursive descent parsers is to model pars...
The structure of monadic functional programs allows the integration of many different features by ju...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop...
A monad is presented which is suitable for writing concurrent programs in a purely functional progra...
. A monad for concurrent programming that is suitable for being built into Haskell is presented. The...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop...