Mon 16 Jan 2023 11:45 - 12:07 at Studio 1 - Logical Foundations Chair(s): Robbert Krebbers

In this article, we show how one can formalise in type theory mathematical objects, for which dependent types are usually deemed unavoidable, using only simple types. We outline a method to encode most of the terms of Lean’s dependent type theory into the simple type theory of Isabelle/HOL. Taking advantage of Isabelle’s automation, we illustrate our method with the formalisation in Isabelle/HOL of a mathematical notion developed in the 1980s: strict omega-categories. Strict omega-categories are generalisations of strict $n$-categories. According to Ross Street, $n$-categories were first introduced by John Roberts as coefficient structures to define non-abelian cohomology in the context of algebraic quantum field theory.

Mon 16 Jan

Displayed time zone: Eastern Time (US & Canada) change

11:00 - 12:30
Logical FoundationsCPP at Studio 1
Chair(s): Robbert Krebbers Radboud University Nijmegen
11:00
22m
Talk
A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systemsdistinguished paper
CPP
Christina Kohl University of Innsbruck, Aart Middeldorp University of Innsbruck
11:22
22m
Talk
Formalizing and computing propositional quantifiersremote presentation
CPP
Hugo Férée Université Paris Cité / IRIF, Sam van Gool Université Paris Cité / IRIF
11:45
22m
Talk
Encoding Dependently-Typed Constructions into Simple Type Theoryremote presentation
CPP
Anthony Bordg University of Cambridge, Adrián Doña Mateo The University of Edinburgh
12:07
22m
Talk
A Computational Cantor-Bernstein and Myhill’s Isomorphism Theorem in Constructive Type Theory (Proof Pearl)
CPP
Yannick Forster Inria, Felix Jahn Saarland University, Gert Smolka Saarland University