Primitive (co)recursion and course-of-values (co)iteration, categorically (1999)

by Tarmo Uustalu , Varmo Vene
Venue:Informatica
Citations:13 - 6 self

Documents Related by Co-Citation

21 Recursion Schemes from Comonads – Tarmo Uustalu, Varmo Vene, Alberto Pardo - 2001
105 Data structures and program transformation – G Malcolm - 1990
97 and Order in Algorithmics – Law - 1992
94 Recursive types and type constraints in second-order lambda calculus – P F Mendler - 1987
8 Mendler-Style Inductive Types, Categorically – Tarmo Uustalu, Varmo Vene - 1999
9 Recursive coalgebras from comonads – Venanzio Capretta, Tarmo Uustalu, Varmo Vene - 2006
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
70 Codifying guarded definitions with recursive schemes – Eduardo Giménez - 1995
134 Towards a Mathematical Operational Semantics – Daniele Turi, Gordon Plotkin - 1997
9 Structural recursive de in type theory – E Gimenez - 1998
22 Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types – R Matthes - 1998
6 A Cube of Proof Systems for the Intuitionistic Predicate mu-,nu-Logic – Tarmo Uustalu, Varmo Vene - 1997
84 Algebraic Data Types and Program Transformation – G Malcolm - 1990
66 A Categorical Programming Language – Tatsuya Hagino, Tatsuya Hagino - 1987
215 An introduction to the theory of lists – R S Bird - 1987
34 Generalised Folds for Nested Datatypes – Richard Bird, Ross Paterson - 1999
326 Theorems for free! – Philip Wadler - 1989
9 Substitution in Non-wellfounded Syntax with Variable Binding – Ralph Matthes, Tarmo Uustalu - 2003
7 Coalgebraic Monads – Neil Ghani, Christoph Lüth, Federico De Marchi - 2002