|
10
|
Minimal realization of machines in closed categories
– J Goguen
- 1972
|
|
39
|
Bicategories of Processes
– P. Katis, N. Sabadini, R. F. C. Walters
- 1997
|
|
7
|
The Dual of Substitution is Redecoration
– Tarmo Uustalu, Varmo Vene
- 2002
|
|
1
|
Comonadic functional attribute evaluation
– Tarmo Uustalu, Varmo Vene
|
|
3
|
Freyd is Kleisli, for arrows
– Bart Jacobs, Ichiro Hasuo
- 2006
|
|
39
|
Generalized sequential machine maps
– J W Thatcher
- 2004
|
|
25
|
Bottom-Up and Top-Down Tree Transformations|A Comparison
– J Engelfriet
- 1975
|
|
11
|
The essence of dataflow programming
– Tarmo Uustalu, Varmo Vene
- 2005
|
|
108
|
Mappings and grammars on trees
– William C Rounds
- 1970
|
|
89
|
Premonoidal Categories and Notions of Computation
– John Power, Edmund Robinson
- 1995
|
|
10
|
Arrows, like monads, are monoids
– Chris Heunen, Bart Jacobs
- 2006
|
|
89
|
Categorical logic and type theory
– B Jacobs
- 1999
|
|
133
|
Generalising Monads to Arrows
– John Hughes
- 1998
|
|
123
|
Tree automata techniques and applications
– Hubert Comon, Max Dauchet, Florent Jacquemard, Denis Lugiez, Sophie Tison, Marc Tommasi
- 1997
|
|
3
|
Matrices, machines and behaviors
– S Bloom, N Sabadini, R F C Walters
- 1996
|
|
2
|
Lax monads
– A Carboni, R Rosebrugh
- 1991
|
|
1
|
On observing nondeterminism and concurrency. Automata, languages and programming
– M Hennessey, R Milner
- 1980
|
|
1
|
On partita doppia. Theory and Applications of Categories
– P Katis, N Sabadini, R F C Walters
|
|
2
|
Classes of Finite State Automata for Which Compositional Minimization is Linear Time
– P. Katis
- 2001
|
