Filter your results
- 52
- 29
- 15
- 5
- 1
- 3
- 2
- 1
- 26
- 13
- 9
- 9
- 8
- 7
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 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
- 1
- 1
- 1
- 1
- 93
- 21
- 102
- 102
- 14
- 13
- 7
- 6
- 6
- 5
- 5
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 102
- 102
- 102
- 102
- 102
- 102
- 102
- 102
- 102
- 102
- 102
- 101
- 99
- 98
- 81
- 79
- 79
- 24
- 24
- 24
- 24
- 24
- 23
- 21
- 19
- 19
- 14
- 13
- 13
- 13
- 13
- 11
- 11
- 11
- 10
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 97
- 5
- 90
- 12
- 7
- 14
- 16
- 15
- 17
- 22
- 11
102 Results
|
Correct and Complete Type Checking and Certified Erasure for Coq, in Coq2023
Preprints, Working Papers, ...
hal-04077552v1
|
||
|
Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-one and Truth-table Reducibility in CoqCSL 2023 - 31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.1-21, ⟨10.4230/LIPIcs.CSL.2023.16⟩
Conference papers
hal-03901942v1
|
||
|
Deciding contextual equivalence of ν-calculus with effectful contexts (full version)2023
Preprints, Working Papers, ...
hal-03955303v1
|
||
|
Compositional pre-processing for automated reasoning in dependent type theoryCPP 2023 - Certified Programs and Proofs, Jan 2023, Boston, United States. pp.1-15, ⟨10.1145/3573105.3575676⟩
Conference papers
hal-03901019v2
|
||
|
A Computational Cantor-Bernstein and Myhill's Isomorphism Theorem in Constructive Type TheoryCPP 2023 - 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2023, Boston, United States. pp.1-8, ⟨10.1145/3573105.3575690⟩
Conference papers
hal-03891390v1
|
||
|
Impredicative Observational EqualityPOPL 2023 - 50th ACM SIGPLAN Symposium on Principles of Programming Languages, Jan 2023, Boston, United States. pp.74, ⟨10.1145/3571739⟩
Conference papers
hal-03857705v2
|
||
|
Design patterns of hierarchies for order structures2023
Preprints, Working Papers, ...
hal-04008820v1
|
||
Computing with Extensionality Principles in Type TheoryLogic in Computer Science [cs.LO]. Nantes Université, 2022. English. ⟨NNT : ⟩
Theses
tel-03923041v1
|
|||
|
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
|
||
|
A Reasonably Gradual Type TheoryProceedings of the ACM on Programming Languages, In press
Journal articles
hal-03596652v2
|
||
|
Boxroot, fast movable GC roots for a better FFIML Family Workshop, Benoît Montagu, Sep 2022, Ljubljana, Slovenia
Conference papers
hal-03910313v1
|
||
|
Synthetic Kolmogorov Complexity in CoqITP 2022 - 13th International Conference on Interactive Theorem Proving, Aug 2022, Haifa, Israel
Conference papers
hal-03596267v2
|
||
|
Acquiring Maps of Interrelated Conjectures on Sharp BoundsCP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. pp.1-18, ⟨10.4230/LIPIcs.CP.2022.6⟩
Conference papers
hal-03789045v1
|
||
|
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
|
||
|
Bidirectional Typing for the Calculus of Inductive ConstructionsAutre [cs.OH]. Nantes Université, 2022. Français. ⟨NNT : 2022NANU4033⟩
Theses
tel-03848595v2
|
||
|
The Advantages of Maintaining a Multitask, Project-Specific Bot: An Experience ReportIEEE Software, 2022, pp.2-7. ⟨10.1109/MS.2022.3179773⟩
Journal articles
hal-03479327v2
|
||
|
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
|
||
|
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
|
||
|
Games, mobile processes, DfunctionsCSL 2022 - 30th EACSL Annual Conference on Computer Science Logic, Feb 2022, Göttingen, Germany. pp.1-35
Conference papers
hal-03407123v1
|
||
|
Observational Equality: Now For GoodProceedings of the ACM on Programming Languages, 2022, 6 (POPL), pp.1-29. ⟨10.1145/3498693⟩
Journal articles
hal-03367052v4
|
||
|
Gradualizing the Calculus of Inductive ConstructionsACM Transactions on Programming Languages and Systems (TOPLAS), 2022, ⟨10.1145/3495528⟩
Journal articles
hal-02896776v5
|
||
|
The Multiverse: Logical Modularity for Proof Assistants2021
Preprints, Working Papers, ...
hal-03324596v1
|
||
|
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
|
||
|
Probabilistic resource limits using StatMemprofOCaml 2021- OCaml Users and Developers Workshop, Aug 2021, Online, France. pp.1-2
Conference papers
hal-03517592v1
|
||
|
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
|
||
|
Compositional relational reasoning via operational game semanticsLICS 2021 - 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470524⟩
Conference papers
hal-03510294v1
|
||
|
Complete Bidirectional Typing for the Calculus of Inductive ConstructionsITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Rome, Italy. pp.1-19, ⟨10.4230/LIPIcs.ITP.2021.24⟩
Conference papers
hal-03139924v2
|
||
|
Unsolvability of the Quintic Formalized in Dependent Type TheoryITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Rome / Virtual, France
Conference papers
hal-03136002v4
|
||
|
Types are internal infinity-groupoidsLICS 2021, Jun 2021, Rome, Italy
Conference papers
hal-03133144v2
|
||
|
Temporal Refinements for Guarded Recursive TypesESOP 2021 - 30th European Symposium on Programming, Mar 2021, Luxembourg, Luxembourg. pp.548-578, ⟨10.1007/978-3-030-72019-3_20⟩
Conference papers
hal-03517430v1
|