# Books and tutorials

### From HaskellWiki

(Difference between revisions)

m (Updated link for "Practical Foundations of Mathematics") |
m (updated of the link to the book "Grammars and Parsing" to a newer version) |
||

Line 26: | Line 26: | ||

==Formal Languages and Automata, Grammars and Parsing using Haskell== | ==Formal Languages and Automata, Grammars and Parsing using Haskell== | ||

* Grammars and Parsing by Johan Jeuring and Doaitse Swierstra is available: | * Grammars and Parsing by Johan Jeuring and Doaitse Swierstra is available: | ||

− | [http:// | + | [http://www.cs.uu.nl/docs/vakken/gont/diktaat.pdf - Download and take a look to the following:] |

** 3.1 The type 'Parser' pp 47 | ** 3.1 The type 'Parser' pp 47 | ||

** 3.2 Elementary parsers pp 49 | ** 3.2 Elementary parsers pp 49 | ||

** 3.3 Parser combinator pp 52 | ** 3.3 Parser combinator pp 52 | ||

** 5.1 Finite state automata pp 85 | ** 5.1 Finite state automata pp 85 |

## Revision as of 14:56, 22 June 2008

## Contents |

## 1 Books

See Books.

## 2 Tutorials

See Tutorials.

## 3 Foundations

Some books and links listed here can be found also in the articles of *Theoretical foundations* category

- see Mathematics
- or browse
*Theoretical foundations*among Special:Categories.

- Practical Foundations of Mathematics
- Paul Taylor. Cambridge University Press, ISBN: 0-521-63107-6, xii+576 pages, September 2000.

- Toposes, Triples and Theories
- Michael Barr and Charles Wells. The revised version of their formerly Springer Verlag published book is online for free download. Note that they use the name
*triple*instead of*monad*.

## 4 Research papers

- Haskell research papers are collected on haskell.org
- Also, an online bibliography of Haskell research at ReadScheme.org

## 5 Formal Languages and Automata, Grammars and Parsing using Haskell

- Grammars and Parsing by Johan Jeuring and Doaitse Swierstra is available:

- Download and take a look to the following:

- 3.1 The type 'Parser' pp 47
- 3.2 Elementary parsers pp 49
- 3.3 Parser combinator pp 52
- 5.1 Finite state automata pp 85