3 research outputs found
Decalf: A Directed, Effectful Cost-Aware Logical Framework
We present , a irected, ffectful ost-ware ogical ramework for studying
quantitative aspects of functional programs with effects. Like ,
the language is based on a formal phase distinction between the extension and
the intension of a program, its pure behavior as distinct from its cost
measured by an effectful step-counting primitive. The type theory ensures that
the behavior is unaffected by the cost accounting. Unlike , the
present language takes account of effects, such as probabilistic choice and
mutable state; this extension requires a reformulation of 's
approach to cost accounting: rather than rely on a "separable" notion of cost,
here a cost bound is simply another program. To make this formal, we equip
every type with an intrinsic preorder, relaxing the precise cost accounting
intrinsic to a program to a looser but nevertheless informative estimate. For
example, the cost bound of a probabilistic program is itself a probabilistic
program that specifies the distribution of costs. This approach serves as a
streamlined alternative to the standard method of isolating a recurrence that
bounds the cost in a manner that readily extends to higher-order, effectful
programs.
The development proceeds by first introducing the type system,
which is based on an intrinsic ordering among terms that restricts in the
extensional phase to extensional equality, but in the intensional phase
reflects an approximation of the cost of a program of interest. This
formulation is then applied to a number of illustrative examples, including
pure and effectful sorting algorithms, simple probabilistic programs, and
higher-order functions. Finally, we justify via a model in the
topos of augmented simplicial sets
The Category of Cpos From a Synthetic Viewpoint
AbstractWe provide an internal characterization of the category ω-Cpo of ω-complete posets and ω-continuous functions within the model ℋ of SDT recently introduced by the authors. It follows that ω-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness