Filtrer vos résultats
- 26
- 22
- 31
- 11
- 4
- 1
- 1
- 1
- 48
- 1
- 4
- 5
- 5
- 1
- 4
- 1
- 1
- 3
- 3
- 3
- 2
- 2
- 5
- 1
- 4
- 1
- 1
- 1
- 46
- 2
- 26
- 24
- 20
- 16
- 11
- 8
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 48
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
48 résultats
|
|
|
triés par
|
|
|
A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points (extended version)2023
Pré-publication, Document de travail
hal-04169137v1
|
||
Local validity for circular proofs in linear logic with fixed points: extended versionComputer Science Logic, Sep 2018, Birmingham, United Kingdom
Communication dans un congrès
hal-01825477v1
|
|||
|
|
λμ-calculus and Λμ-calculus: a Capital Difference2009
Pré-publication, Document de travail
inria-00524942v1
|
||
Separation with streams in the $\Lambda\mu$-calculus20th Annual IEEE Symposium on Logic In Computer Science - LICS 2005, Jun 2005, Chicago, United States. pp.356-365, ⟨10.1109/LICS.2005.48⟩
Communication dans un congrès
hal-00527871v1
|
|||
|
|
Canonical Sequent Proofs via Multi-FocusingFifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, Sep 2008, Milano, Italy. pp.383-396, ⟨10.1007/978-0-387-09680-3_26⟩
Communication dans un congrès
hal-00527893v1
|
||
On the dependencies of logical rulesFOSSACS, 18th International Conference on Foundations of Software Science and Computation Structures, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01110340v1
|
|||
Analyse de dépendances et correction des réseaux de preuveJFLA 2014 - Vingt-cinquièmes Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France
Communication dans un congrès
hal-01110338v1
|
|||
|
|
Towards Completeness via Proof Search in the Linear Time mu-Calculus2016
Pré-publication, Document de travail
hal-01275289v1
|
||
|
|
A Hierarchy for Delimited Continuations in Call-by-Name13th International Conference on Software Science and Computational Structures - FOSSACS 2010, Mar 2010, Paphos, Cyprus. pp.374-388, ⟨10.1007/978-3-642-12032-9_26⟩
Communication dans un congrès
hal-00527925v1
|
||
|
|
On relation between totality semantic and syntactic validity5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
Communication dans un congrès
lirmm-03271408v1
|
||
|
|
From Focalization of Logic to the Logic of FocalizationTwenty-Sixth Conference on the Mathematical Foundations of Programming Semantics - MFPS XXVI, May 2010, Ottawa, Canada. pp.161-176, ⟨10.1016/j.entcs.2010.08.010⟩
Communication dans un congrès
hal-00527916v1
|
||
The Fixed Point Property and a Technique to Harness Double Fixed Point Combinators2017
Pré-publication, Document de travail
hal-01672846v1
|
|||
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic16th EACSL Annual Conference on Computer Science and Logic - CSL 2007, Sep 2007, Lausanne, Switzerland. pp.405-419, ⟨10.1007/978-3-540-74915-8_31⟩
Communication dans un congrès
istex
hal-00527888v1
|
|||
|
|
Nécessité faite loiJFLA, Jan 2014, Fréjus, France
Communication dans un congrès
hal-01248779v1
|
||
|
|
The fixed point property and a technique to harness double fixed point combinatorsJournal of Logic and Computation, 2019, 29 (5), pp.831-880. ⟨10.1093/logcom/exz013⟩
Article dans une revue
hal-02408192v1
|
||
Classical by-needEuropean Symposium on Programming, Apr 2016, Eindhoven, Netherlands
Communication dans un congrès
hal-01257348v1
|
|||
|
|
Infinets: The parallel syntax for non-wellfounded proof-theoryTABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom
Communication dans un congrès
hal-02337286v1
|
||
|
|
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthdayMathematical Structures in Computer Science, 29 (8), pp.1007-1008, 2019, ⟨10.1017/S0960129519000136⟩
N°spécial de revue/special issue
hal-02408211v1
|
||
Decision problems for linear logic with least and greatest fixed points (Extended version)2022
Pré-publication, Document de travail
hal-03655651v1
|
|||
|
|
Infinets: The parallel syntax for non-wellfounded proof-theory2021
Pré-publication, Document de travail
hal-02166199v2
|
||
|
|
Infinitary proof theory : the multiplicative additive case2016
Pré-publication, Document de travail
hal-01339037v1
|
||
|
|
Canonical proof-objects for coinductive programming: infinets with infinitely many cutsPPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, Sep 2021, Tallinn, Estonia. pp.1-15, ⟨10.1145/3479394.3479402⟩
Communication dans un congrès
hal-03371935v1
|
||
|
|
A Curry-Howard Correspondence for Linear, Reversible ComputationCSL 2023 - 31st EACSL Annual Conference on Computer Science Logic, Bartek Klin and Elaine Pimentel, Feb 2023, Varsovie (Warsaw), Poland. ⟨10.4230/LIPIcs.CSL.2023.13⟩
Communication dans un congrès
hal-04308283v1
|
||
|
|
Stream Associative Nets and Lambda-mu-calculus[Research Report] RR-6431, INRIA. 2008, pp.48
Rapport
inria-00221221v3
|
||
|
|
Phase Semantics for Linear Logic with Least and Greatest Fixed PointsFSTTCS 2022 - 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2022, Chennai, India. pp.35:1--35:23, ⟨10.4230/LIPIcs.FSTTCS.2022.35⟩
Communication dans un congrès
hal-04061582v1
|
||
|
|
Eliminating infinitely many cuts in non-wellfounded MLL proof-nets2021
Pré-publication, Document de travail
hal-03235591v1
|
||
Nécessité faite loi: de la réduction linéaire de tête à l'évaluation paresseuse.JFLA 2014 - Vingt-cinquièmes Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France
Communication dans un congrès
hal-01110337v1
|
|||
Least and Greatest Fixed Points in Ludics24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Sep 2015, Berlin, Germany. pp.549--566, ⟨10.4230/LIPIcs.CSL.2015.549⟩
Communication dans un congrès
hal-01256773v1
|
|||
|
|
Standardization and Böhm Trees for $\Lambda\mu$-CalculusTenth International Symposium on Functional and Logic Programming - FLOPS 2010, Apr 2010, Sendai, Japan. pp.134-149, ⟨10.1007/978-3-642-12251-4_11⟩
Communication dans un congrès
hal-00527926v1
|
||
On the Relations between the Syntactic Theories of $\lambda\mu$-Calculi17th EACSL Annual Conference on Computer Science Logic - CSL 2008, Sep 2008, Bertinoro, Italy. pp.154-168, ⟨10.1007/978-3-540-87531-4_13⟩
Communication dans un congrès
istex
hal-00527930v1
|
- 1
- 2