1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Abstracting Denotational Interpreters
Sebastian Graf, Simon Peyton Jones, Sven Keidel
We explore denotational interpreters: denotational semantics that produce coinductive traces of a corresponding small-step operational semantics. By parameterising our denotational…
Triemaps that match
Simon Peyton Jones, Sebastian Graf
The trie data structure is a good choice for finite maps whose keys are data structures (trees) rather than atomic values. But what if we want the keys to be patterns, each of whic…
Efficient and Sound Differentiable Programming in a Functional Array-Processing Language
Amir Shaikhha, Mathieu Huot, Shabnam Ghasemirad +3
Automatic differentiation (AD) is a technique for computing the derivative of a function represented by a program. This technique is considered as the de-facto standard for computi…
Trees That Grow
Shayan Najd, Simon Peyton Jones
We study the notion of extensibility in functional data types, as a new approach to the problem of decorating abstract syntax trees with additional sets of information. We observed…