Roadmap » History » Version 1
Denis Buzdalov, 02/07/2019 01:33 PM
| 1 | 1 | Denis Buzdalov | h1. Roadmap |
|---|---|---|---|
| 2 | |||
| 3 | |||
| 4 | * support for discrete finite probability distributions |
||
| 5 | |||
| 6 | * basic data structure |
||
| 7 | |||
| 8 | * monadicity |
||
| 9 | |||
| 10 | * monad instance |
||
| 11 | * monad laws tests |
||
| 12 | * monad transformer |
||
| 13 | |||
| 14 | * arrowicity |
||
| 15 | |||
| 16 | * arrow instance |
||
| 17 | * arrow laws tests |
||
| 18 | |||
| 19 | * Eff interpreter |
||
| 20 | |||
| 21 | * support for timed value/calculation representation |
||
| 22 | |||
| 23 | * basic data structure |
||
| 24 | |||
| 25 | * monadicity |
||
| 26 | |||
| 27 | * monad instance |
||
| 28 | * monad laws tests |
||
| 29 | * monad transformer |
||
| 30 | |||
| 31 | * arrowicity |
||
| 32 | |||
| 33 | * arrow instance |
||
| 34 | * arrow laws tests |
||
| 35 | |||
| 36 | * Eff interpreter |
||
| 37 | |||
| 38 | * timed computation examples with different combinations with other effects: single and multiple values, probability distributions, interactive values, etc. |
||
| 39 | |||
| 40 | * extended data structure with generalized time value (not only a single time) |
||
| 41 | |||
| 42 | * monadicity |
||
| 43 | |||
| 44 | * monad instance |
||
| 45 | * monad laws tests |
||
| 46 | * monad transformer |
||
| 47 | |||
| 48 | * arrowicity |
||
| 49 | |||
| 50 | * arrow instance |
||
| 51 | * arrow laws tests |
||
| 52 | |||
| 53 | * Eff interpreter |
||
| 54 | |||
| 55 | * extended data structure with typelevel time value |
||
| 56 | |||
| 57 | * monadicity |
||
| 58 | |||
| 59 | * indexed monad instance |
||
| 60 | * indexed monad laws tests |
||
| 61 | |||
| 62 | * arrowicity |
||
| 63 | |||
| 64 | * investigating _indexed arrow_ notion |
||
| 65 | * indexed arrow instance |
||
| 66 | * indexed arrow laws tests |
||
| 67 | |||
| 68 | * Eff |
||
| 69 | |||
| 70 | * investigating support of Eff-like structures in the _indexed_ manner |
||
| 71 | |||
| 72 | * data structure joining the two extensions |
||
| 73 | |||
| 74 | * automated building of timed computations composition based on some abstract model with timed computations assigned to components |
||
| 75 | |||
| 76 | * development of simple model allowing to describe elements, connection points and connections between elements allowing to assign timed computations to elements |
||
| 77 | |||
| 78 | * implementation of building of the model-level timed-computation based on the model description |
||
| 79 | |||
| 80 | * translation |
||
| 81 | |||
| 82 | * static check of compatibility of connected timed computations |
||
| 83 | |||
| 84 | * tracing errors back to the model in terms of the model (using optics) |