From the 1 of 4 linked papers with an AI index.
4 papers
Complexity Theory of Randomised Testing
Pingshi Yu, Chengsong Tan, Nicolas Wu +1
The paper develops a complexity-theoretic framework for random input generators used in software testing, showing that any recursively enumerable language can be generated and char…
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…
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…
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…