Paul Chiusano
@pchiusano.bsky.social
Working on @unison-lang.org
A lot of the incidental complexity of software can be traced back to people using something other than a real programming language to get computers to do a thing.
More here: www.linkedin.com/posts/pchius...
More here: www.linkedin.com/posts/pchius...
March 5, 2025 at 5:55 PM
A lot of the incidental complexity of software can be traced back to people using something other than a real programming language to get computers to do a thing.
More here: www.linkedin.com/posts/pchius...
More here: www.linkedin.com/posts/pchius...
`Each` is one of more magical-seeming abilities in Unison, lets you write straight line code to express nondeterminism. Example -
each [1,2,3] + 1000
Ends up as a lazy mapping over the list. share.unison-lang.org/@unison/base...
each [1,2,3] + 1000
Ends up as a lazy mapping over the list. share.unison-lang.org/@unison/base...
January 29, 2025 at 8:45 PM
`Each` is one of more magical-seeming abilities in Unison, lets you write straight line code to express nondeterminism. Example -
each [1,2,3] + 1000
Ends up as a lazy mapping over the list. share.unison-lang.org/@unison/base...
each [1,2,3] + 1000
Ends up as a lazy mapping over the list. share.unison-lang.org/@unison/base...
Think I figured out how to generalize skew-binary to arbitrary arity K, yielding O(1) *worst-case* cons, and O(log_k(n)) random access. Here's example of tree it builds for K=4.
This is relevant for log-structured merge, avoid logarithmic number of "carries". Code:
gist.github.com/pchiusano/32...
This is relevant for log-structured merge, avoid logarithmic number of "carries". Code:
gist.github.com/pchiusano/32...
![43 | > List.foldRight Skew.cons (Skew [] []) (range 0 64)
⧩
Skew
[]
[ (4, [Tree [0, 1, 2, 3] []])
, ( 20
, [ Tree
[4, 5, 6, 7]
[ Tree [8, 9, 10, 11] []
, Tree [12, 13, 14, 15] []
, Tree [16, 17, 18, 19] []
, Tree [20, 21, 22, 23] []
]
, Tree
[24, 25, 26, 27]
[ Tree [28, 29, 30, 31] []
, Tree [32, 33, 34, 35] []
, Tree [36, 37, 38, 39] []
, Tree [40, 41, 42, 43] []
]
, Tree
[44, 45, 46, 47]
[ Tree [48, 49, 50, 51] []
, Tree [52, 53, 54, 55] []
, Tree [56, 57, 58, 59] []
, Tree [60, 61, 62, 63] []
]
]
)
]](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:a3bn7kaoxobhxylr5tw4op4k/bafkreic3qkqgbdatxuhchvchbculbjkkk2zsol437gztgcgwwhjjajyhvm@jpeg)
December 14, 2024 at 12:29 AM
Think I figured out how to generalize skew-binary to arbitrary arity K, yielding O(1) *worst-case* cons, and O(log_k(n)) random access. Here's example of tree it builds for K=4.
This is relevant for log-structured merge, avoid logarithmic number of "carries". Code:
gist.github.com/pchiusano/32...
This is relevant for log-structured merge, avoid logarithmic number of "carries". Code:
gist.github.com/pchiusano/32...
A nice moment on the internet. Comment thread on “The Sun Is In Your Eyes” by Jacob Collier.
December 6, 2024 at 2:36 AM
A nice moment on the internet. Comment thread on “The Sun Is In Your Eyes” by Jacob Collier.