Comments on: A trie for length-typed vectors
http://conal.net/blog/posts/a-trie-for-length-typed-vectors
Inspirations & experiments, mainly about denotative/functional programming in HaskellSat, 26 Sep 2020 21:06:12 +0000hourly1http://wordpress.org/?v=4.1.17By: Conal Elliott » Blog Archive » A third view on trees
http://conal.net/blog/posts/a-trie-for-length-typed-vectors#comment-813
Sat, 04 Jun 2011 21:35:51 +0000http://conal.net/blog/?p=308#comment-813[…] Alternatively, make the tree sizes explicit in the types, as in a few recent posts, including A trie for length-typed vectors. (In those posts, I used the terms "right-folded" and "left-folded" in place of […]
]]>By: Conal Elliott » Blog Archive » Composable parallel scanning
http://conal.net/blog/posts/a-trie-for-length-typed-vectors#comment-812
Wed, 02 Mar 2011 19:24:35 +0000http://conal.net/blog/?p=308#comment-812[…] of inits and tails on lists) to depth-typed, perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The difficulty I encounter is that the functions initTs and tailTs make […]
]]>By: Conal Elliott » Blog Archive » Deriving parallel tree scans
http://conal.net/blog/posts/a-trie-for-length-typed-vectors#comment-811
Tue, 01 Mar 2011 20:41:44 +0000http://conal.net/blog/?p=308#comment-811[…] to extend the derivation to depth-typed, perfectly balanced trees, of the sort I played with in A trie for length-typed vectors and From tries to trees. The functions initTs and tailTs make unbalanced trees out of balanced […]
]]>