Filtrer vos résultats
- 30
- 21
- 28
- 13
- 8
- 1
- 1
- 4
- 51
- 23
- 2
- 3
- 1
- 2
- 1
- 2
- 2
- 2
- 2
- 1
- 3
- 3
- 5
- 2
- 4
- 1
- 7
- 1
- 1
- 1
- 1
- 1
- 3
- 51
- 26
- 19
- 8
- 8
- 5
- 5
- 5
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 51
- 8
- 6
- 4
- 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
- 1
- 1
- 1
- 1
- 1
51 résultats
|
|
|
triés par
|
Type inference in intuitionistic linear logic12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2010), Jul 2010, Hagenberg, Austria. pp.219-230, ⟨10.1145/1836089.1836118⟩
Communication dans un congrès
hal-00543120v1
|
|||
On Light Logics, Uniform Encodings and Polynomial Time.Mathematical Structures in Computer Science, 2006, 16 (4), pp.713-733
Article dans une revue
hal-00153257v1
|
|||
On Basic Feasible Functionals and the Interpretation MethodFoSSaCS 2024 - International Conference on Foundations of Software Science and Computation Structures, Apr 2024, Luxembourg City, Luxembourg
Communication dans un congrès
hal-04376613v1
|
|||
|
|
Linear logic by levels and bounded time complexityTheoretical Computer Science, 2010, 411 (2), pp. 470--503. ⟨10.1016/j.tcs.2009.09.015⟩
Article dans une revue
hal-00488531v1
|
||
|
|
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy9th Asian Symposium on Programming Languages and Systems APLAS 2011, Dec 2011, Kenting, Taiwan. pp 337-352, ⟨10.1007/978-3-642-25318-8_25⟩
Communication dans un congrès
hal-00798307v1
|
||
|
|
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, ⟨10.1007/978-3-662-44602-7_13⟩
Communication dans un congrès
hal-01015171v2
|
||
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.Proceedings of Typed Lambda Calculi and Applications (TLCA'07), 2007, Paris, France. à paraître
Communication dans un congrès
hal-00153142v1
|
|||
|
|
On quasi-interpretations, blind abstractions and implicit complexity.Mathematical Structures in Computer Science, 2012, 22 (04), pp.549-580. ⟨10.1017/S0960129511000685⟩
Article dans une revue
hal-00798377v1
|
||
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.1997, pp.68-75
Communication dans un congrès
hal-00084630v1
|
|||
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.Logic for Programming, Artificial Intelligence, and Reasoning - 20thInternational Conference, LPAR-20, Nov 2015, Suva, Fiji. pp.203-218
Communication dans un congrès
hal-01948334v1
|
|||
Timeless gamesComputer Science Logic, Aug 1997, Denmark. pp.56-77
Communication dans un congrès
hal-00519856v1
|
|||
Light logics and optimal reduction: Completeness and complexityInformation and Computation, 2011, 209 (2), pp.118-142. ⟨10.1016/j.ic.2010.10.002⟩
Article dans une revue
istex
hal-00798315v1
|
|||
|
|
Types for Parallel Complexity in the Pi-calculus2019
Pré-publication, Document de travail
hal-02302544v1
|
||
|
|
Combining Linear Logic and Size Types for Implicit ComplexityTheoretical Computer Science, 2020, 813, pp.70-99
Article dans une revue
hal-01687224v1
|
||
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy.Information and Computation, 2015, 241, pp.3-31
Article dans une revue
hal-01948302v1
|
|||
|
|
Types for Complexity of Parallel Computation in Pi-calculus (Long Version)ACM Transactions on Programming Languages and Systems (TOPLAS), 2022, 44 (3), pp.1-50
Article dans une revue
hal-02961427v3
|
||
An affine-intuitionistic system of types and effects: confluence and terminationWorkshop LOLA "Syntax and Semantics of Low Level Languages", Jul 2010, Edimbourg, United Kingdom
Communication dans un congrès
hal-00625760v1
|
|||
Mobile Multi-Agent Systems: A Programming Language and Its Semantics.AAMAS 2004 - 3rd International Joint Conference on Autonomous Agents and Multi-Agents Systems, Jul 2004, New York, United States. pp.1386-1387
Communication dans un congrès
hal-00084634v1
|
|||
|
|
Soft lambda-calculus: a language for polynomial time computation2003
Pré-publication, Document de travail
hal-00012751v1
|
||
|
|
Higher-order interpretations and program complexityInformation and Computation, 2016, ⟨10.1016/j.ic.2015.12.008⟩
Article dans une revue
hal-01337728v1
|
||
|
|
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States
Communication dans un congrès
hal-00023668v1
|
||
Mobile multi-agent systems: a programming language and its semanticsAAMAS04, 2004, United States
Communication dans un congrès
hal-00084483v1
|
|||
|
|
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic.2006
Autre publication scientifique
hal-00021834v1
|
||
|
|
BiGKAT: an algebraic framework for relational verification of probabilistic programs2023
Pré-publication, Document de travail
hal-04017128v2
|
||
|
|
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes32nd International Conference on Concurrency Theory, CONCUR 2021, Aug 2021, Virtual conference, France. pp.34:1--34:22
Communication dans un congrès
hal-03198277v2
|
||
|
|
An affine-intuitionistic system of types and effects: confluence and termination2010
Pré-publication, Document de travail
hal-00438101v2
|
||
Type inference for light affine logic via constraints on words.Theoretical Computer Science, 2004, 328(3), pp.289-323
Article dans une revue
hal-00084611v1
|
|||
A feasible algorithm for typing in Elementary Affine Logic.2005, pp.55-70
Communication dans un congrès
hal-00084629v1
|
|||
|
|
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus.8th International Workshop on Logic and Computational Complexity Seattle, August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States
Communication dans un congrès
hal-00085547v3
|
||
Light Logics and Optimal Reduction: Completeness and Complexity.Symposium on Logic in Computer Science (LICS '07), 2007, Wroclaw, Poland. à paraître
Communication dans un congrès
hal-00153136v1
|
- 1
- 2