| pronouns | he/him |
| affiliation | Cornell |
| home | https://www.cs.cornell.edu/~asampson |
| Carly Rae | Jepsen |
It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three common functional data-structuring approaches-lists using Cons, arrays using Update (both fine-grained operators), and arrays using make-array (a “bulk” operator). We then present I-structure as an alternative and show elegant, efficient, and parallel solutions for the program examples in Id, a language with I-structures. The parallelism in Id is made precise by means of an operational semantics for Id as a parallel reduction system. I-structures make the language nonfunctional, but do not lose determinacy. Finally, we show that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.
if you’re a Kagi user, you might enjoy this redirect rule when you search for papers:
^https?://dl.acm.org/doi/(.*)|https://al.radbox.org/doi/$1
install it in your settings here: https://kagi.com/settings/redirects
I wrote a little thing the other day because it had been rolling around my head for a while.
You Don't Need Overleaf
https://griffinberlste.in/blog/overleaf/
Slava Pestov
Mel mlyoung 
Per Vognsen
Griffin