A framework for point-free program transformation
The subject of this paper is functional program transformation in the so-called point-free style. By this we mean first translating programs to a form consisting only of categorically-inspired combinators, algebraic data types defined as fixed points of functors, and implicit recursion through the u...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2006
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/14350 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/14350 |