arXiv (All)
open access
Polarized Scheme: duality of computation, delimited control, and continuation-passing macro Interleaving
Static type systems for Scheme have traditionally followed one of two paths: manifest type checking with multi-dispatch (Clifton and Leavens, 2005) or latent occurrence typing tailored for untyped interoperation (Tobin-Hochstadt and Felleisen, 2008). In this paper, we propose Polarized Scheme, a sta
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- More Powerful Constant Value Checking with SMT Solving#1201329
- Cambria: Resource Abstraction for Parametrized Algebraic Effects and Handlers#781089
- Cambria: Resource Abstraction for Parametrized Algebraic Effects and Handlers#779714
- The Status of Arguments in Abstract Argumentation Frameworks. A Tableaux Method#709036
- Complete Dynamic Logic of Communicating Hybrid Programs#1386160
Record · ID 1401442
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive