We abstract the common type-and-scope safe structure from computations on λ-terms that deliver, eg, renaming, substitution, evaluation, CPS-transformation, and printing with a name …
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-construction …
E Cavallo, R Harper - Logical Methods in Computer Science, 2021 - lmcs.episciences.org
We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory …
I present a datatype-generic treatment of recursive container types whose elements are guaranteed to be stored in increasing order, with the ordering invariant rolled out …
M Patrignani - arxiv preprint arxiv:2001.11334, 2020 - arxiv.org
Syntax highlighting in the form of colours and font diversification, is an excellent tool to provide clarity, concision and correctness to writings. Unfortunately, this practice is not …
We give the first relationally parametric model of the extensional calculus of constructions. Our model remains as simple as traditional PER models of types, but unlike them, it …