arXiv (All)
open access
First-Class Refinement Types for Scala
Refinement types -- types qualified with logical predicates -- have proven effective for lightweight verification in languages like Liquid Haskell, F*, and Dafny. However, in these systems refinements are either written in a separate specification language or treated as second-class annotations, dis
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
- Usability Validation of PFL-X: A Minimal Protocol for Testing Readability Interpretability and Independent Application#701352
- Post-Training Language Models for Gold-Medal Performance in Coding Competitions#971891
- Unifying Function- and Argument-First Bidirectional Type Systems#822413
- (C0) Physmatics Translator Layer#694257
- HyDra: Demystifying and Taming Dynamic Context Parallelism at Production Scale#1119391
Record · ID 1115542
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