Refinement types are integrated as first-class citizens in Scala 3 with full participation in the type system, backed by a mechanized soundness proof in Rocq and a prototype compiler extension using an e-graph solver.
Refinement Types: A Tutorial.Found
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
cs.PL 3years
2026 3roles
background 3polarities
background 3representative citing papers
Underapproximate types with symbolic traces guide synthesis of test generators that outperform defaults in property-based testing and model checking for effectful programs.
Formalizes hybrid synchronous program semantics including differential equations and zero-crossings, extends refinement types for verification, and proves soundness.
citing papers explorer
-
First-Class Refinement Types for Scala
Refinement types are integrated as first-class citizens in Scala 3 with full participation in the type system, backed by a mechanized soundness proof in Rocq and a prototype compiler extension using an e-graph solver.
-
Trace-Guided Synthesis of Effectful Test Generators
Underapproximate types with symbolic traces guide synthesis of test generators that outperform defaults in property-based testing and model checking for effectful programs.
-
Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types
Formalizes hybrid synchronous program semantics including differential equations and zero-crossings, extends refinement types for verification, and proves soundness.