Instances of computational effects: An algebraic perspective

S Staton - 2013 28th Annual ACM/IEEE Symposium on Logic in …, 2013 - ieeexplore.ieee.org
We investigate the connections between computational effects, algebraic theories, and
monads on functor categories. We develop a syntactic framework with variable binding that …

A nominal exploration of intuitionism

V Rahli, M Bickford - Proceedings of the 5th ACM SIGPLAN Conference …, 2016 - dl.acm.org
This papers extends the Nuprl proof assistant (a system representative of the class of
extensional type theories a la Martin-Lof) with named exceptions and handlers, as well as a …

Validating Brouwer's continuity principle for numbers using named exceptions

V Rahli, M Bickford - Mathematical Structures in Computer Science, 2018 - cambridge.org
This paper extends the Nuprl proof assistant (a system representative of the class of
extensional type theories with dependent types) with named exceptions and handlers, as …

Denotational semantics with nominal scott domains

S Lösch, AM Pitts - Journal of the ACM (JACM), 2014 - dl.acm.org
When defining computations over syntax as data, one often runs into tedious issues
concerning α-equivalence and semantically correct manipulations of binding constructs …

Full abstraction for nominal Scott domains

S Lösch, AM Pitts - ACM SIGPLAN Notices, 2013 - dl.acm.org
We develop a domain theory within nominal sets and present programming language
constructs and results that can be gained from this approach. The development is based on …

Program equivalence in functional metaprogramming via nominal Scott domains

S Loesch - 2014 - cl.cam.ac.uk
A prominent feature of metaprogramming is to write algorithms in one programming
language (the meta-language) over structures that represent the programs of another …