28 citations · 42 across the 10 of their papers we have counts for
11 papers
Linear Constraints
Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy +2
Linear constraints are the linear counterpart of Haskell's class constraints. Linearly typed parameters allow the programmer to control resources such as file handles and manually…
Full Abstraction for Free
Marco Paviotti, Nicolas Wu
Structured recursion schemes such as folds and unfolds have been widely used for structuring both functional programs and program semantics. In this context, it has been customary…
Folding over Neural Networks
Minh Nguyen, Nicolas Wu
Neural networks are typically represented as data structures that are traversed either through iteration or by manual chaining of method calls. However, a deeper analysis reveals t…
Fusing Industry and Academia at GitHub (Experience Report)
Patrick Thomson, Rob Rix, Nicolas Wu +1
GitHub hosts hundreds of millions of code repositories written in hundreds of different programming languages. In addition to its hosting services, GitHub provides data and insight…
Modular Probabilistic Models via Algebraic Effects
Minh Nguyen, Roly Perera, Meng Wang +1
Probabilistic programming languages (PPLs) allow programmers to construct statistical models and then simulate data or perform inference over them. Many PPLs restrict models to a p…
Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes
Zhixuan Yang, Nicolas Wu
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphi…