LUCID, the dataflow programming language
LUCID, the dataflow programming language
Notions of computation and monads
Information and Computation
Implicit parameters: dynamic scoping with static types
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Science of Computer Programming - Special issue on mathematics of program construction
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Combining a monad and a comonad
Theoretical Computer Science
The dual of substitution is redecoration
Trends in functional programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
Monads and Comonads in Intensional Semantics
Monads and Comonads in Intensional Semantics
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Journal of Functional Programming
Towards a higher-order synchronous data-flow language
Proceedings of the 4th ACM international conference on Embedded software
Completely iterative algebras and completely iterative monads
Information and Computation
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
From Comodels to Coalgebras: State and Arrays
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
What does aspect-oriented programming mean for functional programmers?
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Ypnos: declarative, parallel structured grid programming
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Categorifying Computations into Components via Arrows as Profunctors
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order Algebras and Coalgebras from Parameterized Endofunctors
Electronic Notes in Theoretical Computer Science (ENTCS)
Sampling, splitting and merging in coinductive stream calculus
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
When is a container a comonad?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Unifying structured recursion schemes
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Coeffects: unified static analysis of context-dependence
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Stream processing coalgebraically
Science of Computer Programming
| Hi-index | 0.00 |
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectful languages based on strong monads. This continues the work in the early 90s by Brookes, Geva and Van Stone on the use of computational comonads in intensional semantics.