Filter your results
- 53
- 29
- 17
- 5
- 3
- 2
- 1
- 1
- 1
- 26
- 13
- 9
- 9
- 8
- 8
- 7
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 102
- 22
- 1
- 111
- 111
- 16
- 14
- 8
- 8
- 7
- 5
- 5
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 112
- 111
- 111
- 111
- 111
- 111
- 111
- 111
- 111
- 111
- 111
- 111
- 109
- 108
- 86
- 84
- 84
- 28
- 27
- 27
- 27
- 27
- 23
- 23
- 22
- 19
- 16
- 14
- 14
- 14
- 12
- 12
- 12
- 11
- 10
- 10
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 105
- 6
- 1
- 97
- 15
- 10
- 15
- 16
- 15
- 19
- 26
- 11
112 Results
|
Machine-checked computer-aided mathematicsLogic in Computer Science [cs.LO]. Université de Nantes (UN), Nantes, FRA., 2021
Habilitation à diriger des recherches
tel-03107626v2
|
||
|
A Classical Sequent Calculus with Dependent TypesACM Transactions on Programming Languages and Systems (TOPLAS), 2019, 41 (2), pp.1-48. ⟨10.1145/3230625⟩
Journal articles
hal-01519929v3
|
||
|
Preface: Special Issue on Homotopy Type Theory and Univalent FoundationsJournal of Automated Reasoning, 2018, ⟨10.1007/s10817-018-9491-3⟩
Journal articles
hal-01929871v1
|
||
|
A formal proof of the irrationality of ζ(3)Logical Methods in Computer Science, 2021, 17 (1), pp.1-25. ⟨10.23638/LMCS-17(1:16)2021⟩
Journal articles
hal-03517003v1
|
||
|
Calcul Formel et Preuves FormellesLuminy, France. 2018, pp.1-10
Lectures
hal-04116824v1
|
||
|
Gardening with the Pythia A model of continuity in a dependent settingCSL 2022 - Computer Science Logic, Feb 2022, Göttingen, Germany. pp.1-19, ⟨10.4230/LIPIcs.CSL.2022.13⟩
Conference papers
hal-03510671v1
|
||
|
Every λ-Term is Meaningful for the Infinitary Relational ModelLICS 2018 - Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science, ACM, Jul 2018, Oxford, United Kingdom. pp.1-26, ⟨10.1145/nnnnnnn.nnnnnnn⟩
Conference papers
hal-01840744v1
|
||
|
A Classical Sequent Calculus with Dependent Types2018
Preprints, Working Papers, ...
hal-01744359v1
|
||
|
Formalizing Implicative Algebras in CoqITP 2018 - 9th International Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.459-476, ⟨10.1007/978-3-319-94821-8_27⟩
Conference papers
hal-01703524v1
|
||
|
Parametric Church’s Thesis: Synthetic Computability Without ChoiceLogical Foundations of Computer Science, 13137, Springer International Publishing, pp.70-89, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-93100-1_6⟩
Book sections
hal-03889493v1
|
||
|
A sequent calculus with dependent types for classical arithmeticLICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.720-729, ⟨10.1145/3209108.3209199⟩
Conference papers
hal-01703526v2
|
||
|
Complete trace models of state and controlESOP 2021 - 30th European Symposium on Programming, Mar 2021, Luxembourg, Luxembourg. pp.348-374, ⟨10.1007/978-3-030-72019-3_13⟩
Conference papers
hal-03510374v1
|
||
|
Static interpretation of higher-order modules in Futhark: functional GPU programming in the largeProceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.97:1--97:30. ⟨10.1145/3236792⟩
Journal articles
hal-01883524v1
|
||
|
Modules over monads and operational semantics5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), 2020, Paris, France. pp.12:1--12:23, ⟨10.4230/LIPIcs.FSCD.2020.12⟩
Conference papers
hal-02338144v3
|
||
|
Theorems for free from separation logic specificationsProceedings of the ACM on Programming Languages, 2021, 5 (ICFP), pp.1-29. ⟨10.1145/3473586⟩
Journal articles
hal-03510684v1
|
||
|
Trakt : Uniformiser les types pour automatiser les preuves (démonstration)JFLA 2022 - 33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.261-263
Conference papers
hal-03626851v1
|
||
|
A Constructive and Synthetic Theory of Reducibility: Myhill's Isomorphism Theorem and Post's Problem for Many-one and Truth-table Reducibility in Coq (Full Version)2022
Preprints, Working Papers, ...
hal-03580081v1
|
||
|
Failure is Not an Option An Exceptional Type TheoryESOP 2018 - 27th European Symposium on Programming, Apr 2018, Thessaloniki, Greece. pp.245-271, ⟨10.1007/978-3-319-89884-1_9⟩
Conference papers
hal-01840643v1
|
||
|
For Finitary Induction-Induction, Induction is EnoughTYPES 2019: 25th International Conference on Types for Proofs and Programs, Jun 2019, Oslo, Norway. pp.6:1-6:30, ⟨10.4230/LIPIcs.TYPES.2019.6⟩
Conference papers
hal-03594037v1
|
||
|
Efficient “out of heap” pointers for multicore OCamlOCaml 2022 - OCaml Users and Developers Workshop, Matija Pretnar, Sep 2022, Ljubljana, Slovenia. pp.1-7
Conference papers
hal-03910312v1
|
||
|
Synthetic Kolmogorov Complexity in CoqITP 2022 - 13th International Conference on Interactive Theorem Proving, Aug 2022, Haifa, Israel
Conference papers
hal-03596267v2
|
||
|
Touring the MetaCoq Project (Invited Paper)LFMTP 2021 - Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2021, Pittsburg, United States. pp.1-17
Conference papers
hal-03516619v1
|
||
Computing with Extensionality Principles in Type TheoryLogic in Computer Science [cs.LO]. Nantes Université, 2022. English. ⟨NNT : ⟩
Theses
tel-03923041v1
|
|||
|
Resource Polymorphism2018
Preprints, Working Papers, ...
hal-01724997v1
|
||
|
Note on Curry's style for Linear Call-by-Push-Value2017
Preprints, Working Papers, ...
hal-01528857v3
|
||
|
Observational Equality: Now For GoodProceedings of the ACM on Programming Languages, 2022, 6 (POPL), pp.1-29. ⟨10.1145/3498693⟩
Journal articles
hal-03367052v4
|
||
|
The Multiverse: Logical Modularity for Proof Assistants2021
Preprints, Working Papers, ...
hal-03324596v1
|
||
|
Russian Constructivism in a Prefascist TheoryLICS 2020 - Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.1-14, ⟨10.1145/3373718.3394740⟩
Conference papers
hal-02548315v1
|
||
|
Definitional Functoriality for Dependent (Sub)Types2023
Preprints, Working Papers, ...
hal-04160858v1
|
||
|
Certified Compilation of Financial ContractsPPDP '18 - 20th International Symposium on Principles and Practice of Declarative Programming, Sep 2018, Frankfurt am Main, Germany. pp.1-13, ⟨10.1145/3236950.3236955⟩
Conference papers
hal-01883559v1
|