Guarded Computational Type Theory
نویسندگان
چکیده
We develop a computational interpretation of guarded dependent type theory with clocks called CTT which enjoys a straightforward operational semantics and immediate canonicity result for base types. Our realizability-style presentation of guarded type theory is a computational and syntactic alternative to category-theoretic accounts of guarded recursion, emphasizing type theory’s role as the ultimate logic of programming.
منابع مشابه
Guarded Cubical Type Theory: Path Equality for Guarded Recursion
This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types. We wish to implement GDTT with decidable type checking, while still supporting non-...
متن کاملGuarded Cubical Type Theory
Guarded dependent type theory [1] is a dependent type theory with guarded recursive types, which are useful for building models of program logics, and as a tool for programming and reasoning with coinductive types. This is done via a modality ., pronounced ‘later’, with a constructor next, and a guarded fixed-point combinator fix : (.A → A) → A. This combinator is used both to define guarded re...
متن کاملConstraint-Based Type Inference for Guarded Algebraic Data Types
Guarded algebraic data types subsume the concepts known in the literature as indexed types, guarded recursive datatype constructors, and first-class phantom types, and are closely related to inductive types. They have the distinguishing feature that, when typechecking a function defined by cases, every branch may be checked under different typing assumptions. This mechanism allows exploiting th...
متن کاملThe Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Guarded recursion in the sense of Nakano allows general recursive types and terms to be added to type theory without breaking consistency. Recent work has demonstrated applications of guarded recursion such as programming with codata, reasoning about coinductive types, as well as constructing and reasoning about denotational models of general recursive types. Guarded recursion can also be used ...
متن کاملOn The Restraining Power of Guards
Guarded fragments of rst-order logic were recently introduced by Andr eka, van Benthem and N emeti; they consist of relational rst-order formulae whose quantiiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017