Freyd is Kleisli, for arrows (2006)

by Bart Jacobs , Ichiro Hasuo
Venue:In C. McBride, T. Uustalu, Proc. of Wksh. on Mathematically Structured Programming, MSFP 2006, Electron. Wkshs. in Computing. BCS
Citations:4 - 2 self

Documents Related by Co-Citation

99 Premonoidal Categories and Notions of Computation – John Power, Edmund Robinson - 1995
7 The Dual of Substitution is Redecoration – Tarmo Uustalu, Varmo Vene - 2002
12 Arrows, like monads, are monoids – Chris Heunen, Bart Jacobs - 2006
159 Generalising Monads to Arrows – John Hughes - 1998
112 Categorical Logic and Type Theory – B Jacobs - 1999
730 Notions of Computation and Monads – Eugenio Moggi - 1991
14 Modelling environments in call-by-value programming languages – Paul Blain Levy, John Power, Hayo Thielecke - 2003
5 Signals and comonads – Tarmo Uustalu, Varmo Vene - 2005
3 Minimal Realization in Bicategories of Automata – Robert Rosebrugh, N. Sabadini, R. F. C. Walters - 1998
39 Generalized sequential machine maps – J W Thatcher - 2004
11 Minimal realization of machines in closed categories – J GOGUEN - 1972
26 Bottom-up and top-down tree transformations—A comparison – Joost Engelfriet - 1975
18 The essence of dataflow programming – Tarmo Uustalu, Varmo Vene - 2005
2 Comonadic functional attribute evaluation – Tarmo Uustalu, Varmo Vene
149 Tree automata techniques and applications – Hubert Comon, Max Dauchet, Florent Jacquemard, Denis Lugiez, Sophie Tison, Marc Tommasi - 1997
119 Mappings and grammars on trees – W Rounds - 1970
8 Direct models of the computational lambda-calculus – C FĂĽhrmann - 1999
11 Algebraic categories with few monoidal biclosed structures or none – F Foltz, C Lair, G M Kelly - 1980
17 Premonoidal categories as categories with algebraic structure – J Power