artem.pelenitsyn at gmail.com
Thu Jun 8 14:34:25 EDT 2017
I have two options for the next week so far:
- V. Vene categorical programming with inductive and coinductive types
(first several chapters) // PhD thesis
- C. Elliot Compiling to categories // ICFP'17
Would it be possible for you to vote for any?
1) (Vene) Categorical means to express common "(co)inductive" types (Lists,
Trees, Streams...) and algorithms on them (fold/unfold).
2) (Elliot) Categorical approach to program transformation in Haskell:
write simple functional program and turn it into 1) graph, 2) hardware
As for the second option (this is my favourite one as it is newer for me):
No deep understanding of Haskell is required, syntax would be described as
we go (we only need the notion and syntax for type classes really).
-------------- next part --------------
HTML attachment scrubbed and removed
More information about the Pl-sem-jr