Underapproximate types with symbolic traces guide synthesis of test generators that outperform defaults in property-based testing and model checking for effectful programs.
Local Temporal Reasoning
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Extends intensional type theory with large sizes and parametric quantifiers to construct inductive and coinductive types, justified by a realisability model interpreting sizes as an uncountable ordinal.
A finitary refinement type system is sound and complete for Scott-open properties in a fixpoint-like logic over spectral Scott domains.
citing papers explorer
-
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.
-
Constructing (Co)inductive Types via Large Sizes
Extends intensional type theory with large sizes and parametric quantifiers to construct inductive and coinductive types, justified by a realisability model interpreting sizes as an uncountable ordinal.
-
A Complete Finitary Refinement Type System for Scott-Open Properties
A finitary refinement type system is sound and complete for Scott-open properties in a fixpoint-like logic over spectral Scott domains.