Gradual ty** for objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous
work we developed a gradual type system for a functional calculus named λ^?_→. Gradual …
work we developed a gradual type system for a functional calculus named λ^?_→. Gradual …
Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
Reasoning about the use of external resources is an important aspect of many practical
applications. Effect systems enable tracking such information in types, but at the cost of …
applications. Effect systems enable tracking such information in types, but at the cost of …
Continuing WebAssembly with Effect Handlers
L Phipps-Costin, A Rossberg, A Guha… - Proceedings of the …, 2023 - dl.acm.org
WebAssembly (Wasm) is a low-level portable code format offering near native performance.
It is intended as a compilation target for a wide variety of source languages. However, Wasm …
It is intended as a compilation target for a wide variety of source languages. However, Wasm …
[PDF][PDF] Reference: Racket
M Flatt - 2010 - mirror.racket-lang.org
The racket library combines racket/base, racket/bool, racket/bytes, racket/class,
racket/cmdline, racket/contract, racket/dict, racket/file, racket/function, racket/future …
racket/cmdline, racket/contract, racket/dict, racket/file, racket/function, racket/future …
Effects as capabilities: effect handlers and lightweight effect polymorphism
Effect handlers have recently gained popularity amongst programming language
researchers. Existing type-and effect systems for effect handlers are often complicated and …
researchers. Existing type-and effect systems for effect handlers are often complicated and …
Abstraction-safe effect handlers via tunneling
Algebraic effect handlers offer a unified approach to expressing control-flow transfer idioms
such as exceptions, iteration, and async/await. Unfortunately, previous attempts to make …
such as exceptions, iteration, and async/await. Unfortunately, previous attempts to make …
Representing layered monads
A Filinski - Proceedings of the 26th ACM SIGPLAN-SIGACT …, 1999 - dl.acm.org
There has already been considerable research on constructing modular, monad-based
specifications of computational effects (state, exceptions, nondeterminism, etc.) in …
specifications of computational effects (state, exceptions, nondeterminism, etc.) in …
A Curry-Howard foundation for functional computation with control
We introduce the type theory λμv, a call-by-value variant of Parigot's λμ-calculus, as a Curry-
Howard representation theory of classical propositional proofs. The associated rewrite …
Howard representation theory of classical propositional proofs. The associated rewrite …
Perceus: Garbage free reference counting with reuse
We introduce Perceus, an algorithm for precise reference counting with reuse and
specialization. Starting from a functional core language with explicit control-flow, Perceus …
specialization. Starting from a functional core language with explicit control-flow, Perceus …
Embedded probabilistic programming
O Kiselyov, C Shan - IFIP Working Conference on Domain-Specific …, 2009 - Springer
Two general techniques for implementing a domain-specific language (DSL) with less
overhead are the finally-tagless embedding of object programs and the direct-style …
overhead are the finally-tagless embedding of object programs and the direct-style …