Publications

{ "response":{"numFound":50,"start":0,"numFoundExact":true,"docs":[ { "citationRef_s":"2023", "citationFull_s":"Leandro Gomes, Patrick Baillot, Marco Gaboardi. A Kleene algebra with tests for union bound reasoning on probabilistic programs. 2023. <a target=\"_blank\" href=\"https://hal.science/hal-04196675\">⟨hal-04196675⟩</a>", "title_s":["A Kleene algebra with tests for union bound reasoning on probabilistic programs"], "authFullName_s":["Leandro Gomes", "Patrick Baillot", "Marco Gaboardi"], "halId_s":"hal-04196675", "docType_s":"UNDEFINED", "producedDateY_i":2023}, { "citationRef_s":"ESOP 2023 - European Symposium on Programming, Apr 2023, Paris, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.48550/arXiv.2202.01901\">⟨10.48550/arXiv.2202.01901⟩</a>", "citationFull_s":"June Wunder, Arthur Azevedo De Amorim, Patrick Baillot, Marco Gaboardi. Bunched Fuzz: Sensitivity for Vector Metrics. ESOP 2023 - European Symposium on Programming, Apr 2023, Paris, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.48550/arXiv.2202.01901\">⟨10.48550/arXiv.2202.01901⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03870966\">⟨hal-03870966⟩</a>", "title_s":["Bunched Fuzz: Sensitivity for Vector Metrics"], "authFullName_s":["June Wunder", "Arthur Azevedo De Amorim", "Patrick Baillot", "Marco Gaboardi"], "halId_s":"hal-03870966", "docType_s":"COMM", "producedDateY_i":2023}, { "citationRef_s":"2023", "citationFull_s":"Leandro Gomes, Patrick Baillot, Marco Gaboardi. BiGKAT: an algebraic framework for relational verification of probabilistic programs. 2023. <a target=\"_blank\" href=\"https://hal.science/hal-04017128v2\">⟨hal-04017128v2⟩</a>", "title_s":["BiGKAT: an algebraic framework for relational verification of probabilistic programs"], "authFullName_s":["Leandro Gomes", "Patrick Baillot", "Marco Gaboardi"], "halId_s":"hal-04017128", "docType_s":"UNDEFINED", "producedDateY_i":2023}, { "citationRef_s":"ACM Transactions on Programming Languages and Systems (TOPLAS), 2022, 44 (3), pp.1-50", "citationFull_s":"Patrick Baillot, Alexis Ghyselen. 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. <a target=\"_blank\" href=\"https://hal.science/hal-02961427v3\">⟨hal-02961427v3⟩</a>", "title_s":["Types for Complexity of Parallel Computation in Pi-calculus (Long Version)"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen"], "halId_s":"hal-02961427", "docType_s":"ART", "producedDateY_i":2022}, { "citationRef_s":"32nd International Conference on Concurrency Theory, CONCUR 2021, Aug 2021, Virtual conference, France. pp.34:1--34:22", "citationFull_s":"Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi. Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. 32nd International Conference on Concurrency Theory, CONCUR 2021, Aug 2021, Virtual conference, France. pp.34:1--34:22. <a target=\"_blank\" href=\"https://hal.science/hal-03198277v2\">⟨hal-03198277v2⟩</a>", "title_s":["Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen", "Naoki Kobayashi"], "halId_s":"hal-03198277", "docType_s":"COMM", "producedDateY_i":2021}, { "citationRef_s":"30th European Symposium on Programming (ESOP 2021), Mar 2021, Luxembourg, Luxembourg. pp.59-86", "citationFull_s":"Patrick Baillot, Alexis Ghyselen. Types for Complexity of Parallel Computation in Pi-Calculus. 30th European Symposium on Programming (ESOP 2021), Mar 2021, Luxembourg, Luxembourg. pp.59-86. <a target=\"_blank\" href=\"https://hal.science/hal-03126973\">⟨hal-03126973⟩</a>", "title_s":["Types for Complexity of Parallel Computation in Pi-Calculus"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen"], "halId_s":"hal-03126973", "docType_s":"COMM", "producedDateY_i":2021}, { "citationRef_s":"Theoretical Computer Science, 2020, 813, pp.70-99", "citationFull_s":"Patrick Baillot, Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. Theoretical Computer Science, 2020, 813, pp.70-99. <a target=\"_blank\" href=\"https://hal.science/hal-01687224\">⟨hal-01687224⟩</a>", "title_s":["Combining Linear Logic and Size Types for Implicit Complexity"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen"], "halId_s":"hal-01687224", "docType_s":"ART", "producedDateY_i":2020}, { "citationRef_s":"Journal of Automated Reasoning, 2019, 63 (4), pp.813-855. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-48899-7_15\">⟨10.1007/978-3-662-48899-7_15⟩</a>", "citationFull_s":"Patrick Baillot, Gilles Barthe, Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. Journal of Automated Reasoning, 2019, 63 (4), pp.813-855. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-48899-7_15\">⟨10.1007/978-3-662-48899-7_15⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01197456v3\">⟨hal-01197456v3⟩</a>", "title_s":["Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs"], "authFullName_s":["Patrick Baillot", "Gilles Barthe", "Ugo Dal Lago"], "halId_s":"hal-01197456", "docType_s":"ART", "producedDateY_i":2019}, { "citationRef_s":"2019", "citationFull_s":"Patrick Baillot, Alexis Ghyselen. Types for Parallel Complexity in the Pi-calculus. 2019. <a target=\"_blank\" href=\"https://hal.science/hal-02302544\">⟨hal-02302544⟩</a>", "title_s":["Types for Parallel Complexity in the Pi-calculus"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen"], "halId_s":"hal-02302544", "docType_s":"UNDEFINED", "producedDateY_i":2019}, { "citationRef_s":"Conference on Computer Science Logic, CSL 2018, Sep 2018, Birmingham, France. pp.9:1--9:21", "citationFull_s":"Patrick Baillot, Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. Conference on Computer Science Logic, CSL 2018, Sep 2018, Birmingham, France. pp.9:1--9:21. <a target=\"_blank\" href=\"https://hal.science/hal-01948196\">⟨hal-01948196⟩</a>", "title_s":["Combining Linear Logic and Size Types for Implicit Complexity"], "authFullName_s":["Patrick Baillot", "Alexis Ghyselen"], "halId_s":"hal-01948196", "docType_s":"COMM", "producedDateY_i":2018}, { "citationRef_s":"Information and Computation, 2018, 248, pp.55-77", "citationFull_s":"Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus.. Information and Computation, 2018, 248, pp.55-77. <a target=\"_blank\" href=\"https://hal.science/hal-01948275\">⟨hal-01948275⟩</a>", "title_s":["Characterizing polynomial and exponential complexity classes in elementary lambda-calculus."], "authFullName_s":["Patrick Baillot", "Erika de Benedetti", "Simona Ronchi Della Rocca"], "halId_s":"hal-01948275", "docType_s":"ART", "producedDateY_i":2018}, { "citationRef_s":"Computer Science Logic 2016, Aug 2016, Marseille, France. pp. 40:1-40:18, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CSL.2016.40\">⟨10.4230/LIPIcs.CSL.2016.40⟩</a>", "citationFull_s":"Patrick Baillot, Anupam Das. Free-cut elimination in linear logic and an application to a feasible arithmetic . Computer Science Logic 2016, Aug 2016, Marseille, France. pp. 40:1-40:18, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CSL.2016.40\">⟨10.4230/LIPIcs.CSL.2016.40⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01316754\">⟨hal-01316754⟩</a>", "title_s":["Free-cut elimination in linear logic and an application to a feasible arithmetic"], "authFullName_s":["Patrick Baillot", "Anupam Das"], "halId_s":"hal-01316754", "docType_s":"COMM", "producedDateY_i":2016}, { "citationRef_s":"Information and Computation, 2016, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2015.12.008\">⟨10.1016/j.ic.2015.12.008⟩</a>", "citationFull_s":"Patrick Baillot, Ugo Dal Lago. Higher-order interpretations and program complexity. Information and Computation, 2016, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2015.12.008\">⟨10.1016/j.ic.2015.12.008⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01337728\">⟨hal-01337728⟩</a>", "title_s":["Higher-order interpretations and program complexity"], "authFullName_s":["Patrick Baillot", "Ugo Dal Lago"], "halId_s":"hal-01337728", "docType_s":"ART", "producedDateY_i":2016}, { "citationRef_s":"Logic for Programming, Artificial Intelligence, and Reasoning - 20thInternational Conference, LPAR-20, Nov 2015, Suva, Fiji. pp.203-218", "citationFull_s":"Patrick Baillot, Gilles Barthe, Ugo Dal Lago. 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. <a target=\"_blank\" href=\"https://hal.science/hal-01948334\">⟨hal-01948334⟩</a>", "title_s":["Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs."], "authFullName_s":["Patrick Baillot", "Gilles Barthe", "Ugo Dal Lago"], "halId_s":"hal-01948334", "docType_s":"COMM", "producedDateY_i":2015}, { "citationRef_s":"Information and Computation, 2015, 241, pp.3-31", "citationFull_s":"Patrick Baillot. On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy.. Information and Computation, 2015, 241, pp.3-31. <a target=\"_blank\" href=\"https://hal.science/hal-01948302\">⟨hal-01948302⟩</a>", "title_s":["On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy."], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-01948302", "docType_s":"ART", "producedDateY_i":2015}, { "citationRef_s":"8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-44602-7_13\">⟨10.1007/978-3-662-44602-7_13⟩</a>", "citationFull_s":"Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-44602-7_13\">⟨10.1007/978-3-662-44602-7_13⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01015171v2\">⟨hal-01015171v2⟩</a>", "title_s":["Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus"], "authFullName_s":["Patrick Baillot", "Erika de Benedetti", "Simona Ronchi Della Rocca"], "halId_s":"hal-01015171", "docType_s":"COMM", "producedDateY_i":2014}, { "citationRef_s":"21st Annual Conference of the EACSL, Computer Science Logic 2012 (CSL), Sep 2012, Fontainebleau, France. pp.62-76, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CSL.2012.62\">⟨10.4230/LIPIcs.CSL.2012.62⟩</a>", "citationFull_s":"Patrick Baillot, Ugo Dal Lago. Higher-Order Interpretations and Program Complexity. 21st Annual Conference of the EACSL, Computer Science Logic 2012 (CSL), Sep 2012, Fontainebleau, France. pp.62-76, <a target=\"_blank\" href=\"https://dx.doi.org/10.4230/LIPIcs.CSL.2012.62\">⟨10.4230/LIPIcs.CSL.2012.62⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00798298\">⟨hal-00798298⟩</a>", "title_s":["Higher-Order Interpretations and Program Complexity"], "authFullName_s":["Patrick Baillot", "Ugo Dal Lago"], "halId_s":"hal-00798298", "docType_s":"COMM", "producedDateY_i":2012}, { "citationRef_s":"2012", "citationFull_s":"Patrick Baillot, Ugo Dal Lago. Higher-order Interpretations and Program Complexity (Long Version). 2012. <a target=\"_blank\" href=\"https://hal.science/hal-00667816\">⟨hal-00667816⟩</a>", "title_s":["Higher-order Interpretations and Program Complexity (Long Version)"], "authFullName_s":["Patrick Baillot", "Ugo Dal Lago"], "halId_s":"hal-00667816", "docType_s":"UNDEFINED", "producedDateY_i":2012}, { "citationRef_s":"Mathematical Structures in Computer Science, 2012, 22 (04), pp.549-580. <a target=\"_blank\" href=\"https://dx.doi.org/10.1017/S0960129511000685\">⟨10.1017/S0960129511000685⟩</a>", "citationFull_s":"Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On quasi-interpretations, blind abstractions and implicit complexity.. Mathematical Structures in Computer Science, 2012, 22 (04), pp.549-580. <a target=\"_blank\" href=\"https://dx.doi.org/10.1017/S0960129511000685\">⟨10.1017/S0960129511000685⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00798377\">⟨hal-00798377⟩</a>", "title_s":["On quasi-interpretations, blind abstractions and implicit complexity."], "authFullName_s":["Patrick Baillot", "Ugo Dal Lago", "Jean-Yves Moyen"], "halId_s":"hal-00798377", "docType_s":"ART", "producedDateY_i":2012}, { "citationRef_s":"9th Asian Symposium on Programming Languages and Systems APLAS 2011, Dec 2011, Kenting, Taiwan. pp 337-352, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-25318-8_25\">⟨10.1007/978-3-642-25318-8_25⟩</a>", "citationFull_s":"Patrick Baillot. Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. 9th Asian Symposium on Programming Languages and Systems APLAS 2011, Dec 2011, Kenting, Taiwan. pp 337-352, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-25318-8_25\">⟨10.1007/978-3-642-25318-8_25⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00798307\">⟨hal-00798307⟩</a>", "title_s":["Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy"], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00798307", "docType_s":"COMM", "producedDateY_i":2011}, { "citationRef_s":"2011", "citationFull_s":"Patrick Baillot. Elementary linear logic revisited for polynomial time and an exponential time hierarchy (extended version). 2011. <a target=\"_blank\" href=\"https://hal.science/hal-00624742\">⟨hal-00624742⟩</a>", "title_s":["Elementary linear logic revisited for polynomial time and an exponential time hierarchy (extended version)"], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00624742", "docType_s":"REPORT", "producedDateY_i":2011}, { "citationRef_s":"Information and Computation, 2011, 209 (2), pp.118-142. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.10.002\">⟨10.1016/j.ic.2010.10.002⟩</a>", "citationFull_s":"Patrick Baillot, Paolo Coppola, Ugo Dal Lago. Light logics and optimal reduction: Completeness and complexity. Information and Computation, 2011, 209 (2), pp.118-142. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.10.002\">⟨10.1016/j.ic.2010.10.002⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00798315\">⟨hal-00798315⟩</a>", "title_s":["Light logics and optimal reduction: Completeness and complexity"], "authFullName_s":["Patrick Baillot", "Paolo Coppola", "Ugo Dal Lago"], "halId_s":"hal-00798315", "docType_s":"ART", "producedDateY_i":2011}, { "citationRef_s":"12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2010), Jul 2010, Hagenberg, Austria. pp.219-230, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/1836089.1836118\">⟨10.1145/1836089.1836118⟩</a>", "citationFull_s":"Patrick Baillot, Martin Hofmann. Type inference in intuitionistic linear logic. 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2010), Jul 2010, Hagenberg, Austria. pp.219-230, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/1836089.1836118\">⟨10.1145/1836089.1836118⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00543120\">⟨hal-00543120⟩</a>", "title_s":["Type inference in intuitionistic linear logic"], "authFullName_s":["Patrick Baillot", "Martin Hofmann"], "halId_s":"hal-00543120", "docType_s":"COMM", "producedDateY_i":2010}, { "citationRef_s":"Workshop LOLA \"Syntax and Semantics of Low Level Languages\", Jul 2010, Edimbourg, United Kingdom", "citationFull_s":"Roberto M. Amadio, Patrick Baillot, Antoine Madet. An affine-intuitionistic system of types and effects: confluence and termination. Workshop LOLA \"Syntax and Semantics of Low Level Languages\", Jul 2010, Edimbourg, United Kingdom. <a target=\"_blank\" href=\"https://hal.science/hal-00625760\">⟨hal-00625760⟩</a>", "title_s":["An affine-intuitionistic system of types and effects: confluence and termination"], "authFullName_s":["Roberto M. Amadio", "Patrick Baillot", "Antoine Madet"], "halId_s":"hal-00625760", "docType_s":"COMM", "producedDateY_i":2010}, { "citationRef_s":"2010", "citationFull_s":"Roberto Amadio, Patrick Baillot, Antoine Madet. An affine-intuitionistic system of types and effects: confluence and termination. 2010. <a target=\"_blank\" href=\"https://hal.science/hal-00438101v2\">⟨hal-00438101v2⟩</a>", "title_s":["An affine-intuitionistic system of types and effects: confluence and termination"], "authFullName_s":["Roberto Amadio", "Patrick Baillot", "Antoine Madet"], "halId_s":"hal-00438101", "docType_s":"UNDEFINED", "producedDateY_i":2010}, { "citationRef_s":"19th European Symposium on Programming (ESOP 2010), Mar 2010, Paphos, Cyprus. pp. 104-124, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-11957-6\">⟨10.1007/978-3-642-11957-6⟩</a>", "citationFull_s":"Patrick Baillot, Marco Gaboardi, Virgile Mogbil. A PolyTime Functional Language from Light Linear Logic. 19th European Symposium on Programming (ESOP 2010), Mar 2010, Paphos, Cyprus. pp. 104-124, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-11957-6\">⟨10.1007/978-3-642-11957-6⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00443944\">⟨hal-00443944⟩</a>", "title_s":["A PolyTime Functional Language from Light Linear Logic"], "authFullName_s":["Patrick Baillot", "Marco Gaboardi", "Virgile Mogbil"], "halId_s":"hal-00443944", "docType_s":"COMM", "producedDateY_i":2010}, { "citationRef_s":"Theoretical Computer Science, 2010, 411 (2), pp. 470--503. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2009.09.015\">⟨10.1016/j.tcs.2009.09.015⟩</a>", "citationFull_s":"Patrick Baillot, Damiano Mazza. Linear logic by levels and bounded time complexity. Theoretical Computer Science, 2010, 411 (2), pp. 470--503. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2009.09.015\">⟨10.1016/j.tcs.2009.09.015⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-00488531\">⟨hal-00488531⟩</a>", "title_s":["Linear logic by levels and bounded time complexity"], "authFullName_s":["Patrick Baillot", "Damiano Mazza"], "halId_s":"hal-00488531", "docType_s":"ART", "producedDateY_i":2010}, { "citationRef_s":"Symposium on Logic in Computer Science (LICS '07), 2007, Wroclaw, Poland. à paraître", "citationFull_s":"Patrick Baillot, Paolo Coppola, Ugo Dal Lago. Light Logics and Optimal Reduction: Completeness and Complexity.. Symposium on Logic in Computer Science (LICS '07), 2007, Wroclaw, Poland. à paraître. <a target=\"_blank\" href=\"https://hal.science/hal-00153136\">⟨hal-00153136⟩</a>", "title_s":["Light Logics and Optimal Reduction: Completeness and Complexity."], "authFullName_s":["Patrick Baillot", "Paolo Coppola", "Ugo Dal Lago"], "halId_s":"hal-00153136", "docType_s":"COMM", "producedDateY_i":2007}, { "citationRef_s":"Proceedings of Typed Lambda Calculi and Applications (TLCA'07), 2007, Paris, France. à paraître", "citationFull_s":"Patrick Baillot. 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. <a target=\"_blank\" href=\"https://hal.science/hal-00153142\">⟨hal-00153142⟩</a>", "title_s":["From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing."], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00153142", "docType_s":"COMM", "producedDateY_i":2007}, { "citationRef_s":"ACM Trans. Comput. Log. (10)4. Workshop on Implicit Computational Complexity - Geometry of Computation (GEOCAL'06), Feb 2006, Marseille, France. 10 (4), 2 p., 2009, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/1555746.1555747\">⟨10.1145/1555746.1555747⟩</a>", "citationFull_s":"Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca. Special issue on implicit computational complexity. ACM Trans. Comput. Log. (10)4. Workshop on Implicit Computational Complexity - Geometry of Computation (GEOCAL'06), Feb 2006, Marseille, France. 10 (4), 2 p., 2009, <a target=\"_blank\" href=\"https://dx.doi.org/10.1145/1555746.1555747\">⟨10.1145/1555746.1555747⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00434330\">⟨hal-00434330⟩</a>", "title_s":["Special issue on implicit computational complexity"], "authFullName_s":["Patrick Baillot", "Jean-Yves Marion", "Simona Ronchi Della Rocca"], "halId_s":"hal-00434330", "docType_s":"PRESCONF", "producedDateY_i":2006}, { "citationRef_s":"8th International Workshop on Logic and Computational Complexity Seattle, August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States", "citationFull_s":"Patrick Baillot, Marco Pedicini. 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. <a target=\"_blank\" href=\"https://hal.science/hal-00085547v3\">⟨hal-00085547v3⟩</a>", "title_s":["An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus."], "authFullName_s":["Patrick Baillot", "Marco Pedicini"], "halId_s":"hal-00085547", "docType_s":"COMM", "producedDateY_i":2006}, { "citationRef_s":"8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States", "citationFull_s":"Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. 8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States. <a target=\"_blank\" href=\"https://hal.science/hal-00023668\">⟨hal-00023668⟩</a>", "title_s":["On Quasi-Interpretations, Blind Abstractions and Implicit Complexity"], "authFullName_s":["Patrick Baillot", "Ugo Dal Lago", "Jean-Yves Moyen"], "halId_s":"hal-00023668", "docType_s":"COMM", "producedDateY_i":2006}, { "citationRef_s":"2006", "citationFull_s":"Vincent Atassi, Patrick Baillot, Kazushige Terui. Verification of Ptime reducibility for system F terms via Dual Light Affine Logic.. 2006. <a target=\"_blank\" href=\"https://hal.science/hal-00021834\">⟨hal-00021834⟩</a>", "title_s":["Verification of Ptime reducibility for system F terms via Dual Light Affine Logic."], "authFullName_s":["Vincent Atassi", "Patrick Baillot", "Kazushige Terui"], "halId_s":"hal-00021834", "docType_s":"OTHER", "producedDateY_i":2006}, { "citationRef_s":"Mathematical Structures in Computer Science, 2006, 16 (4), pp.713-733", "citationFull_s":"Ugo Dal Lago, Patrick Baillot. On Light Logics, Uniform Encodings and Polynomial Time.. Mathematical Structures in Computer Science, 2006, 16 (4), pp.713-733. <a target=\"_blank\" href=\"https://hal.science/hal-00153257\">⟨hal-00153257⟩</a>", "title_s":["On Light Logics, Uniform Encodings and Polynomial Time."], "authFullName_s":["Ugo Dal Lago", "Patrick Baillot"], "halId_s":"hal-00153257", "docType_s":"ART", "producedDateY_i":2006}, { "citationRef_s":"2005, pp.55-70", "citationFull_s":"Patrick Baillot, Kazushige Terui. A feasible algorithm for typing in Elementary Affine Logic.. 2005, pp.55-70. <a target=\"_blank\" href=\"https://hal.science/hal-00084629\">⟨hal-00084629⟩</a>", "title_s":["A feasible algorithm for typing in Elementary Affine Logic."], "authFullName_s":["Patrick Baillot", "Kazushige Terui"], "halId_s":"hal-00084629", "docType_s":"COMM", "producedDateY_i":2005}, { "citationRef_s":"AAMAS 2004 - 3rd International Joint Conference on Autonomous Agents and Multi-Agents Systems, Jul 2004, New York, United States. pp.1386-1387", "citationFull_s":"Alexandru Suna, Amal El Fallah-Seghrouchni, Christophe Fouqueré, Patrick Baillot. 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. <a target=\"_blank\" href=\"https://hal.science/hal-00084634\">⟨hal-00084634⟩</a>", "title_s":["Mobile Multi-Agent Systems: A Programming Language and Its Semantics."], "authFullName_s":["Alexandru Suna", "Amal El Fallah-Seghrouchni", "Christophe Fouqueré", "Patrick Baillot"], "halId_s":"hal-00084634", "docType_s":"COMM", "producedDateY_i":2004}, { "citationRef_s":"2004, pp.266-275", "citationFull_s":"Patrick Baillot, Kazushige Terui. Light types for polynomial time computation in lambda-calculus. 2004, pp.266-275. <a target=\"_blank\" href=\"https://hal.science/hal-00003468\">⟨hal-00003468⟩</a>", "title_s":["Light types for polynomial time computation in lambda-calculus"], "authFullName_s":["Patrick Baillot", "Kazushige Terui"], "halId_s":"hal-00003468", "docType_s":"COMM", "producedDateY_i":2004}, { "citationRef_s":"Theoretical Computer Science, 2004, 328(3), pp.289-323", "citationFull_s":"Patrick Baillot. Type inference for light affine logic via constraints on words.. Theoretical Computer Science, 2004, 328(3), pp.289-323. <a target=\"_blank\" href=\"https://hal.science/hal-00084611\">⟨hal-00084611⟩</a>", "title_s":["Type inference for light affine logic via constraints on words."], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00084611", "docType_s":"ART", "producedDateY_i":2004}, { "citationRef_s":"AAMAS04, 2004, United States", "citationFull_s":"Alexandru Suna, Amal El Fallah-Seghrouchni, Christophe Fouqueré, Patrick Baillot. Mobile multi-agent systems: a programming language and its semantics. AAMAS04, 2004, United States. <a target=\"_blank\" href=\"https://hal.science/hal-00084483\">⟨hal-00084483⟩</a>", "title_s":["Mobile multi-agent systems: a programming language and its semantics"], "authFullName_s":["Alexandru Suna", "Amal El Fallah-Seghrouchni", "Christophe Fouqueré", "Patrick Baillot"], "halId_s":"hal-00084483", "docType_s":"COMM", "producedDateY_i":2004}, { "citationRef_s":"2004, pp.27-41", "citationFull_s":"Patrick Baillot, Virgile Mogbil. Soft lambda-calculus: a language for polynomial time computation.. 2004, pp.27-41. <a target=\"_blank\" href=\"https://hal.science/hal-00085129\">⟨hal-00085129⟩</a>", "title_s":["Soft lambda-calculus: a language for polynomial time computation."], "authFullName_s":["Patrick Baillot", "Virgile Mogbil"], "halId_s":"hal-00085129", "docType_s":"COMM", "producedDateY_i":2004}, { "citationRef_s":"Theoretical Computer Science, 2004, 318(1-2): 29-55, pp.29-55", "citationFull_s":"Patrick Baillot. Stratified coherence spaces: a denotational semantics for light linear logic.. Theoretical Computer Science, 2004, 318(1-2): 29-55, pp.29-55. <a target=\"_blank\" href=\"https://hal.science/hal-00084609\">⟨hal-00084609⟩</a>", "title_s":["Stratified coherence spaces: a denotational semantics for light linear logic."], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00084609", "docType_s":"ART", "producedDateY_i":2004}, { "citationRef_s":"2004", "citationFull_s":"Patrick Baillot, Kazushige Terui. Light types for polynomial time computation in lambda-calculus. 2004. <a target=\"_blank\" href=\"https://hal.science/hal-00012752\">⟨hal-00012752⟩</a>", "title_s":["Light types for polynomial time computation in lambda-calculus"], "authFullName_s":["Patrick Baillot", "Kazushige Terui"], "halId_s":"hal-00012752", "docType_s":"UNDEFINED", "producedDateY_i":2004}, { "citationRef_s":"2003", "citationFull_s":"Patrick Baillot, Virgile Mogbil. Soft lambda-calculus: a language for polynomial time computation. 2003. <a target=\"_blank\" href=\"https://hal.science/hal-00012751\">⟨hal-00012751⟩</a>", "title_s":["Soft lambda-calculus: a language for polynomial time computation"], "authFullName_s":["Patrick Baillot", "Virgile Mogbil"], "halId_s":"hal-00012751", "docType_s":"UNDEFINED", "producedDateY_i":2003}, { "citationRef_s":"2002, pp.370-382", "citationFull_s":"Patrick Baillot. Checking polynomial time complexity with types.. 2002, pp.370-382. <a target=\"_blank\" href=\"https://hal.science/hal-00084626\">⟨hal-00084626⟩</a>", "title_s":["Checking polynomial time complexity with types."], "authFullName_s":["Patrick Baillot"], "halId_s":"hal-00084626", "docType_s":"COMM", "producedDateY_i":2002}, { "citationRef_s":"Fundamenta Informaticae, 2001, 45(1-2), pp.1-31", "citationFull_s":"Patrick Baillot, Marco Pedicini. Elementary Complexity and Geometry of Interaction.. Fundamenta Informaticae, 2001, 45(1-2), pp.1-31. <a target=\"_blank\" href=\"https://hal.science/hal-00084627\">⟨hal-00084627⟩</a>", "title_s":["Elementary Complexity and Geometry of Interaction."], "authFullName_s":["Patrick Baillot", "Marco Pedicini"], "halId_s":"hal-00084627", "docType_s":"ART", "producedDateY_i":2001}, { "citationRef_s":"1999, pp.25-39", "citationFull_s":"Patrick Baillot, Marco Pedicini. Elementary Complexity and Geometry of Interaction.. 1999, pp.25-39. <a target=\"_blank\" href=\"https://hal.science/hal-00084631\">⟨hal-00084631⟩</a>", "title_s":["Elementary Complexity and Geometry of Interaction."], "authFullName_s":["Patrick Baillot", "Marco Pedicini"], "halId_s":"hal-00084631", "docType_s":"COMM", "producedDateY_i":1999}, { "citationRef_s":"Computer Science Logic, Aug 1997, Denmark. pp.56-77", "citationFull_s":"Thomas Ehrhard, Vincent Danos, Patrick Baillot, Laurent Regnier. Timeless games. Computer Science Logic, Aug 1997, Denmark. pp.56-77. <a target=\"_blank\" href=\"https://hal.science/hal-00519856\">⟨hal-00519856⟩</a>", "title_s":["Timeless games"], "authFullName_s":["Thomas Ehrhard", "Vincent Danos", "Patrick Baillot", "Laurent Regnier"], "halId_s":"hal-00519856", "docType_s":"COMM", "producedDateY_i":1997}, { "citationRef_s":"Logic in Computer Science, Jun 1997, Poland. pp.68-75", "citationFull_s":"Thomas Ehrhard, Vincent Danos, Patrick Baillot. Believe it or not, AJM's games model is a model of classical linear logic. Logic in Computer Science, Jun 1997, Poland. pp.68-75. <a target=\"_blank\" href=\"https://hal.science/hal-00519846\">⟨hal-00519846⟩</a>", "title_s":["Believe it or not, AJM's games model is a model of classical linear logic"], "authFullName_s":["Thomas Ehrhard", "Vincent Danos", "Patrick Baillot"], "halId_s":"hal-00519846", "docType_s":"COMM", "producedDateY_i":1997}, { "citationRef_s":"1997, pp.56-77", "citationFull_s":"Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Régnier. Timeless Games.. 1997, pp.56-77. <a target=\"_blank\" href=\"https://hal.science/hal-00084632\">⟨hal-00084632⟩</a>", "title_s":["Timeless Games."], "authFullName_s":["Patrick Baillot", "Vincent Danos", "Thomas Ehrhard", "Laurent Régnier"], "halId_s":"hal-00084632", "docType_s":"COMM", "producedDateY_i":1997}, { "citationRef_s":"1997, pp.68-75", "citationFull_s":"Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Régnier. Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.. 1997, pp.68-75. <a target=\"_blank\" href=\"https://hal.science/hal-00084630\">⟨hal-00084630⟩</a>", "title_s":["Believe it or not, AJM's Games Model is a Model of Classical Linear Logic."], "authFullName_s":["Patrick Baillot", "Vincent Danos", "Thomas Ehrhard", "Laurent Régnier"], "halId_s":"hal-00084630", "docType_s":"COMM", "producedDateY_i":1997}] }}

Rechercher

Paramétrage

Thèmes

Accessibilité

Patrick Baillot