5 research outputs found
Semi-simplicial Types in Logic-enriched Homotopy Type Theory
The problem of defining Semi-Simplicial Types (SSTs) in Homotopy Type Theory
(HoTT) has been recognized as important during the Year of Univalent
Foundations at the Institute of Advanced Study. According to the interpretation
of HoTT in Quillen model categories, SSTs are type-theoretic versions of Reedy
fibrant semi-simplicial objects in a model category and simplicial and
semi-simplicial objects play a crucial role in many constructions in homotopy
theory and higher category theory. Attempts to define SSTs in HoTT lead to some
difficulties such as the need of infinitary assumptions which are beyond HoTT
with only non-strict equality types.
Voevodsky proposed a definition of SSTs in Homotopy Type System (HTS), an
extension of HoTT with non-fibrant types, including an extensional strict
equality type. However, HTS does not have the desirable computational
properties such as decidability of type checking and strong normalization. In
this paper, we study a logic-enriched homotopy type theory, an alternative
extension of HoTT with equational logic based on the idea of logic-enriched
type theories. In contrast to Voevodskys HTS, all types in our system are
fibrant and it can be implemented in existing proof assistants. We show how
SSTs can be defined in our system and outline an implementation in the proof
assistant Plastic
The generalised type-theoretic interpretation of constructive set theory
We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation
Categories with families and first-order logic with dependent sorts
First-order logic with dependent sorts, such as Makkai's first-order logic
with dependent sorts (FOLDS), or Aczel's and Belo's dependently typed
(intuitionistic) first-order logic (DFOL), may be regarded as logic enriched
dependent type theories. Categories with families (cwfs) is an established
semantical structure for dependent type theories, such as Martin-L\"of type
theory. We introduce in this article a notion of hyperdoctrine over a cwf, and
show how FOLDS and DFOL fit in this semantical framework. A soundness and
completeness theorem is proved for DFOL. The semantics is functorial in the
sense of Lawvere, and uses a dependent version of the Lindenbaum-Tarski algebra
for a DFOL theory. Agreement with standard first-order semantics is
established. Applications of DFOL to constructive mathematics and categorical
foundations are given. A key feature is a local propositions-as-types
principle.Comment: 83 page
A Relational Logic for Higher-Order Programs
Relational program verification is a variant of program verification where
one can reason about two programs and as a special case about two executions of
a single program on different inputs. Relational program verification can be
used for reasoning about a broad range of properties, including equivalence and
refinement, and specialized notions such as continuity, information flow
security or relative cost. In a higher-order setting, relational program
verification can be achieved using relational refinement type systems, a form
of refinement types where assertions have a relational interpretation.
Relational refinement type systems excel at relating structurally equivalent
terms but provide limited support for relating terms with very different
structures.
We present a logic, called Relational Higher Order Logic (RHOL), for proving
relational properties of a simply typed -calculus with inductive types
and recursive definitions. RHOL retains the type-directed flavour of relational
refinement type systems but achieves greater expressivity through rules which
simultaneously reason about the two terms as well as rules which only
contemplate one of the two terms. We show that RHOL has strong foundations, by
proving an equivalence with higher-order logic (HOL), and leverage this
equivalence to derive key meta-theoretical properties: subject reduction,
admissibility of a transitivity rule and set-theoretical soundness. Moreover,
we define sound embeddings for several existing relational type systems such as
relational refinement types and type systems for dependency analysis and
relative cost, and we verify examples that were out of reach of prior work.Comment: Submitted to ICFP 201
Foundations of dependently sorted logic
The theory of dependently sorted first order logic is developed. Two variants of the notion of a type setup, an abstract characterisation of language with dependent sorts proposed by Peter Aczel, are presented. It is argued that specialisations of these are appropriate for the characterisation of a notion of intuitionistic or classical dependently sorted first order theory and of semantic structure for the interpretation of those theories.EThOS - Electronic Theses Online ServiceGBUnited Kingdo