Name
Abstract | ||
|---|---|---|
In functional programming, the general technique for supporting stream-based computations is by means of (higher-order) functions external to the underline stream's structure. The proposal of this paper is orthogonal to this view and it is based on an alternative representation of streams that allows employing different functions as stream's constructors (re-constructors). The internal computation prescribed by a stream is realised by constructing the stream with its own re-constructors. This provides us with a computationally more active and self-contained stream's notion that allows: (1) deriving new re-constructors by combining other re-constructors, (2) specifying dataflow computations directly inside streams and, dually, (3) defining re-constructors out of dataflow combinators. Moreover, this modelling supports to some degree parallel (sequential) evaluations of unbounded (recursive) structures in the style of Evaluation Strategies. All these possibilities are achieved thanks to a comonadic development able to capture co-inductive streams, parallelism (sequentiality) and causality aspects directly. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1926354.1926362 | Symposium on Principles of Programming Languages |
Keywords | Field | DocType |
comonads,parallel,functional,inside stream,new re-constructors,alternative representation,co-inductive stream,dataflow,dataflow combinators,evaluation strategies,dataflow computation,streams,own re-constructors,defining re-constructors,self-contained stream,higher order functions,functional programming | Programming language,Functional programming,Combinatory logic,Computer science,Theoretical computer science,Dataflow,STREAMS,Recursion,Computation | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joaqu ´ õn Aguado | 1 | 0 | 0.34 |
| Michael Mendler | 2 | 314 | 34.60 |