Typed Non-determinism in Functional and Concurrent Calculi
Abstract elided by the publisher.
Related papers
- Liberating Merges via Apartness and Guarded Subtyping OOPSLA 2025
- A simple semantics for Haskell overloading Haskell 2014
- Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework POPL 2023
- A theory of effects and resources: adjunction models and polarised calculi POPL 2016
- The Complexity of Type Inference for Higher-Order Typed lambda Calculi JFP 1994
- A Type-Directed Operational Semantics For a Calculus with a Merge Operator ECOOP 2020
- Parameterised notions of computation JFP 2009
- Encapsulating Non-Determinacy in an Abstract Data Type with Determinate Semantics JFP 1991