Constructs powerdomains in synthetic domain theory that give computationally adequate models of nondeterminism and embed into dependent type theory.
Mathematical Structures in Computer Science 7, 5 (Oct
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2verdicts
UNVERDICTED 2representative citing papers
Decalf equips types with an intrinsic preorder so that cost bounds for effectful programs become ordinary programs, extending Calf to probabilistic choice and other effects, with a model in augmented simplicial sets.
citing papers explorer
-
Powerdomains and nondeterminism in synthetic domain theory
Constructs powerdomains in synthetic domain theory that give computationally adequate models of nondeterminism and embed into dependent type theory.
-
Decalf: A Directed, Effectful Cost-Aware Logical Framework
Decalf equips types with an intrinsic preorder so that cost bounds for effectful programs become ordinary programs, extending Calf to probabilistic choice and other effects, with a model in augmented simplicial sets.