Start TimeTitleAuthors11:30Modelling Smart Contracts of Bitcoin in AgdaAnton Setzer and Bogdan Gabriel Lazar11:45The Agda Universal Algebra Library and Birkhoff’s Theorem in Dependent Type TheoryWilliam DeMeo12:00A Formal Theory of Games of Incomplete InformationHelene Fargier, Érik Martin-Dorel and Pierre Pomeret-Coquot12:10SSProve: A Foundational Framework for Modular Cryptographic Proofs in CoqCarmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Cătălin Hritcu, Kenji Maillard and Bas Spitters12:20Towards Automation for IrisIke Mulder and Robbert Krebbers
Towards Automation for Iris
1 file(s) 227.53 KB Download
The Agda Universal Algebra Library and Birkhoff’s Theorem in Dependent Type Theory
1 file(s) 156.58 KB Download
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
1 file(s) 286.30 KB Semantic Analysis of Normalization by Evaluation for Fitch-Style Modal Lambda Calculi
1 file(s) 288.74 KB Download
Normalization for multimodal type theory
1 file(s) 231.94 KB Download
Modalities and Parametric Adjoints
1 file(s) 220.19 KB Download
Clocked Cubical Type Theory
1 file(s) 338.62 KB Download