Comonadic Notions of Computation

Electronic Notes in Theoretical Computer Science

Volumn 203, Issue 5, 2008, Pages 263-284

  Uustalu, Tarmo ^a   Vene, Varmo ^b  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

coKleisli semantics; context dependent computation; dataflow computation; symmetric monoidal comonads; tree transformations

Indexed keywords

COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); INFORMATION THEORY; SEMANTICS;

(R ,S)-SYMMETRIC; ATTRIBUTE EVALUATION; COMONADS; CONTEXT-DEPENDENT; DATA FLOW COMPUTATION; ELSEVIER (CO); INTENSIONAL SEMANTICS; LANGUAGES (TRADITIONAL); RELABELLING; TYPED LAMBDA CALCULUS;

COMPUTATIONAL METHODS;

EID: 44649112368     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.05.029     Document Type: Article

References (36)

1. Abbott M., Altenkirch T., and Ghani N. Containers: constructing strictly positive types. Theor. Comput. Sci. 342 1 (2005) 3-27
2. Aczel P., Adàmek J., Milius S., and Velebil J. Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300 1-3 (2003) 1-45
3. Ashcroft E.A., and Wadge W.W. LUCID, the Dataflow Programming Language (1985), Academic Press
4. Benton N., Bierman G., de Paiva V., and Hyland M. Linear lambda-calculus and categorical models revisited. In: Börger E., et al. (Ed). Proc. of 6th Wksh. on Computer Science Logic. CSL '92. Lect. Notes in Comput. Sci. 702 (1993), Springer 61-84
5. Benton N., Hughes J., and Moggi E. Monads and effects. In: Barthe G., Dybjer P., Pinto L., and Saraiva J. (Eds). Advanced Lectures from Int. Summer School on Applied Semantics. APPSEM 2000. Lect. Notes in Comput. Sci. 2395 (2002), Springer 42-122
6. Benton N., and Hyland M. Traced premonoidal categories. Theor. Inform. and Appl. 37 4 (2003) 273-299
7. Bierman G., and de Paiva V. On an intuitionistic modal logic. Studia Logica 65 3 (2000) 383-416
8. Brookes S., and Geva S. Computational comonads and intensional semantics. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Society Lecture Note Series 177 (1992), Cambridge Univ. Press 1-44
9. Brookes, S. and K. Van Stone, "Monads and comonads in intensional semantics," Techn. Report CMU-CS-93-140, School of Comput. Sci., Carnegie Mellon Univ., 1993, 41 pp
10. Colaço J.-L., Girault A., Hamon G., and Pouzet M. Towards a higher-order synchronous data-flow language. Proc. of 4th ACM Int. Conf. on Embedded Software. EMSOFT'04 (2004), ACM Press 230-239
11. Eilenberg S., and Kelly G.M. Closed categories. Proc. of Conf. on Categorical Algebra. (La Jolla, 1965) (1966), Springer 421-562
12. Erkök L., and Launchbury J. Recursive monadic bindings. Proc. of 5th ACM SIGPLAN Int. Conf. on Functional Programming. ICFP '00 (2000), ACM Press 174-185
13. Halbwachs N., Caspi P., Raymond P., and Pilaud D. The synchronous data flow programming language LUSTRE. Proc. of IEEE 79 9 (1991) 1305-1320
14. Hasegawa M. The uniformity principle on traced monoidal categories. In: Blute R., and Selinger P. (Eds). Proc. of 9th Conf. on Category Theory and Computer Science. CTCS '02. Electron. Notes in Comput. Sci. 69 (2003) 137-155 Elsevier
15. Heunen C., and Jacobs B. Arrows, like monads, are monoids. In: Brookes S., and Mislove M. (Eds). Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics. MFPS XXII. Electron. Notes in Theor. Comput. Sci. 158 (2006) 219-236 Elsevier
16. Huet G. The zipper. J. of Funct. Program. 7 5 (1997) 549-554
17. Hughes J. Generalising monads to arrows. Sci. of Comput. Program. 37 1-3 (2000) 67-111
18. Hyland M., Plotkin G., and Power J. Combining effects: sum and tensor. Theor. Comput. Sci. 357 1-3 (2006) 70-99
19. Jacobs, B. and I. Hasuo, Freyd is Kleisli, for arrows, in: C. McBride, T. Uustalu, eds., "Proc. of Wksh. on Mathematically Structured Functional Programming, MSFP 2006," Electron. Wkshs. in Computing, BCS, 2006, 13 pp
20. Kieburtz, R.B., Codata and comonads in Haskell, unpublished manuscript, 1999
21. Knuth D. Semantics of context-free languages. Math. Syst. Theory 2 2 (1968) 127-145 Corrigendum
22. Knuth D. Semantics of context-free languages. Math. Syst. Theory 51 1 (1971) 95-96
23. Lewis J.R., Shields M.B., Meijer E., and Launchbury J. Implicit parameters: dynamic scoping with static types. Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. POPL '00 (2000), ACM Press 108-118
24. McBride, C., The derivative of a regular type is the type of its one-hole contexts, manuscript, 2000
25. Milius S. Completely iterative algebras and completely iterative monads. Inform. and Comput. 196 1 (2005) 1-41
26. Moggi E. Notions of computation and monads. Inform. and Comput. 93 1 (1991) 55-92
27. Moggi E., and Sabry A. An abstract monadic semantics for value recursion. Theor. Inform. and Appl. 38 4 (2004) 375-400
28. Plotkin G., and Power J. Semantics for algebraic operations. In: Brookes S., and Mislove M. (Eds). Proc. of 17th Conf. on Mathematical Foundations of Programming Semantics. MFPS-XVII. Electron. Notes in Theor. Comput. Sci. 45 (2001) 332-345 Elsevier
29. Plotkin G., and Power J. Computational effects and operations: an overview. In: Escardó M.H., and Jung A. (Eds). Proc. of Wksh. on Domains VI. Electron. Notes in Theor. Comput. Sci. 73 (2004) 149-163 Elsevier
30. Pouzet, M., Lucid Synchrone, version 3: tutorial and reference manual, unpublished manuscript, 2006
31. Power J., and Robinson E. Premonoidal categories and notions of computation. Math. Structures in Comput. Sci. 7 5 (1997) 453-468
32. Power J., and Shkaravska O. From comodels to coalgebras: state and arrays. In: Adámek J., and Milius S. (Eds). Proc. of Wksh. on Coalgebraic Methods in Comput. Sci. CMCS 2004. Electron. Notes in Theor. Comput. Sci. 106 (2004) 297-314 Elsevier
33. Power J., and Watanabe H. Combining a monad and a comonad. Theor. Comput. Sci. 280 1-2 (2002) 137-162
34. Uustalu T., and Vene V. The dual of substitution is redecoration. In: Hammond K., and Curtis S. (Eds). Trends in Functional Programming 3 (2002), Intellect 99-110
35. Uustalu T., and Vene V. The essence of dataflow programming (full version). Revised Selected Lectures from 1st Central-European Functional Programming School. CEFP 2005. Lect. Notes in Comput. Sci. 4164 (2006), Springer 135-167
36. Uustalu T., and Vene V. Comonadic functional attribute evaluation. In: van Eekelen M. (Ed). Trends in Functional Programming 6 (2007), Intellect 145-162