2 citations · 4 across the 7 of their papers we have counts for
7 papers
Complexity Theory of Randomised Testing
Pingshi Yu, Chengsong Tan, Nicolas Wu +1
Randomised testing is a widely-used approach to software validation, yet its theoretical foundations remain thin. In particular, the fundamental question of what it means for a set…
Stone Duality for Monads
Richard Garner, Alyssa Renata, Nicolas Wu
We introduce a contravariant idempotent adjunction between (i) the category of ranked monads on ; and (ii) the category of internal categories and internal retrofunct…
Handling Higher-Order Effectful Operations with Judgemental Monadic Laws
Zhixuan Yang, Nicolas Wu
This paper studies the design of programming languages with handlers of higher-order effectful operations -- effectful operations that may take in computations as arguments or retu…
Bayesian Separation Logic
Shing Hin Ho, Nicolas Wu, Azalea Raad
Bayesian probabilistic programming languages (BPPLs) let users denote statistical models as code while the interpreter infers the posterior distribution. The semantics of BPPLs are…
A Non-Terminating Game of Beggar-My-Neighbor
Brayden Casella, Philip M. Anderson, Michael Kleber +5
We demonstrate the existence of a non-terminating game of Beggar-My-Neighbor, discovered by lead author Brayden Casella. We detail the method for constructing this game and identif…
Scoped Effects as Parameterized Algebraic Theories
Cristina Matache, Sam Lindley, Sean Moss +3
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are…
A Specification for Typed Template Haskell
Matthew Pickering, Andres Löh, Nicolas Wu
Multi-stage programming is a proven technique that provides predictable performance characteristics by controlling code generation. We propose a core semantics for Typed Template H…