Filtrer vos résultats
- 21
- 1
- 15
- 3
- 3
- 1
- 22
- 1
- 3
- 2
- 3
- 2
- 5
- 3
- 2
- 2
- 22
- 10
- 9
- 9
- 9
- 8
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 22
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
22 résultats
|
|
triés par
|
|
Do CPS translations also translate realizers?JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.134-151
Communication dans un congrès
hal-03910311v2
|
||
|
Revisiting the duality of computation: an algebraic analysis of classical realizability modelsCSL 2020 - Conference on Computer Science Logic, Jan 2020, Barcelone, Spain. pp.1-52, ⟨10.4230/LIPIcs.CSL.2020.30⟩
Communication dans un congrès
hal-02305560v2
|
||
|
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⟩
Communication dans un congrès
hal-01703524v1
|
||
|
A Classical Sequent Calculus with Dependent TypesACM Transactions on Programming Languages and Systems (TOPLAS), 2019, 41 (2), pp.1-48. ⟨10.1145/3230625⟩
Article dans une revue
hal-01519929v3
|
||
|
Classical realizability and side-effectsLogic in Computer Science [cs.LO]. Université Sorbonne Paris Cité - Université Paris Diderot (Paris 7); Universidad de la República - Montevideo, Uruguay, 2017. English. ⟨NNT : ⟩
Thèse
tel-01653733v2
|
||
|
Continuation-and-environment-passing style translations: a focus on call-by-need2019
Pré-publication, Document de travail
hal-01972846v1
|
||
|
A continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control within System FCL&C'16. Sixth International Workshop on. Classical Logic and Computation, Jun 2016, Porto, Portugal
Communication dans un congrès
hal-01302696v2
|
||
|
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⟩
Communication dans un congrès
hal-01703526v2
|
||
|
Realizability with stateful computations for nonstandard analysisCSL 2021 - Computer Science Logic, Jan 2021, Ljubljana, Slovenia
Communication dans un congrès
hal-03002239v1
|
||
|
Concurrent Realizability on Conjunctive StructuresFSCD 2023 - 8th International Conference on Formal Structures for Computation and Deduction, Jul 2023, Rome, Italy
Communication dans un congrès
hal-04083002v2
|
||
|
Dependent Type Theory in Polarised Sequent Calculus (abstract)TYPES 2020 - 26th International Conference on Types for Proofs and Programs, Mar 2020, Torino, Italy. pp.1-3
Communication dans un congrès
hal-02505671v1
|
||
|
Stateful Realizers for Nonstandard AnalysisLogical Methods in Computer Science, 2023, Volume 19, Issue 2, ⟨10.46298/LMCS-19(2:7)2023⟩
Article dans une revue
hal-04053612v1
|
||
|
Realizability games for arithmetical formulæWorskshop GaLoP2015, Apr 2015, Londres, United Kingdom
Communication dans un congrès
hal-01248093v1
|
||
|
A Classical Sequent Calculus with Dependent Types26th European Symposium on Programming, Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01375977v3
|
||
|
Normalization and continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control2017
Pré-publication, Document de travail
hal-01570987v1
|
||
|
Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With ControlFOSSACS 18 - 21st International Conference on Foundations of Software Science and Computation Structures, Apr 2018, Thessalonique, Greece. pp.276-292, ⟨10.1007/978-3-319-89366-2_15⟩
Communication dans un congrès
hal-01624839v2
|
||
|
A calculus of expandable storesLICS 2020 - 35th ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken / Virtual, Germany. pp.564-577, ⟨10.1145/3373718.3394792⟩
Communication dans un congrès
hal-02557823v2
|
||
|
A Classical Sequent Calculus with Dependent Types2018
Pré-publication, Document de travail
hal-01744359v1
|
||
|
Evidenced Frames: A Unifying Framework Broadening Realizability ModelsLICS 2021, Jul 2021, Rome, Italy
Communication dans un congrès
hal-03422961v1
|
||
|
Classical realizability and arithmetical formulæMathematical Structures in Computer Science, 2016, ⟨10.1017/S0960129515000559⟩
Article dans une revue
hal-01247989v1
|
||
A preview of a tutorial on L (polarized μμ-tilde)HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, Sep 2018, St. Louis, United States
Communication dans un congrès
hal-01992294v1
|
|||
|
Toward dependent choice: a classical sequent calculus with dependent typesTYPES 2015, May 2015, Tallinn, Estonia
Communication dans un congrès
hal-01247998v1
|