Recursion patterns and time-analysis
This paper explores some ideas concerning the time-analysis of functional programs defined by instantiating typical recursion patterns such as folds, unfolds, and hylomorphisms. The concepts in this paper are illustrated through a rich set of examples in the Haskell programming language. We concentr...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2005
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/2762 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/2762 |