default search action
27th TYPES 2021: Leiden, The Netherlands (Virtual Conference)
- Henning Basold, Jesper Cockx, Silvia Ghilezan:
27th International Conference on Types for Proofs and Programs, TYPES 2021, June 14-18, 2021, Leiden, The Netherlands (Virtual Conference). LIPIcs 239, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-254-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:8
- Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer:
Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control. 1:1-1:25 - Thibaut Benjamin:
Formalisation of Dependent Type Theory: The Example of CaTT. 2:1-2:21 - Rafaël Bocquet:
Strictification of Weakly Stable Type-Theoretic Structures Using Generic Contexts. 3:1-3:23 - William J. DeMeo, Jacques Carette:
A Machine-Checked Proof of Birkhoff's Variety Theorem in Martin-Löf Type Theory. 4:1-4:21 - Pietro Di Gianantonio, Marina Lenisa:
Principal Types as Lambda Nets. 5:1-5:23 - István Donkó, Ambrus Kaposi:
Internal Strict Propositions Using Point-Free Equations. 6:1-6:21 - Giulio Fellin, Sara Negri, Eugenio Orlandelli:
Constructive Cut Elimination in Geometric Logic. 7:1-7:16 - Asta Halkjær From:
A Succinct Formalization of the Completeness of First-Order Logic. 8:1-8:24 - Christa Jenkins, Andrew Marmaduke, Aaron Stump:
Simulating Large Eliminations in Cedille. 9:1-9:22 - Georgi Nakov, Fredrik Nordvall Forsberg:
Quantitative Polynomial Functors. 10:1-10:22 - Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes. 11:1-11:24 - Yuta Takahashi:
Size-Based Termination for Non-Positive Types in Simply Typed Lambda-Calculus. 12:1-12:23
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.