Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Patrick Baillot, Alexis Ghyselen, and Naoki Kobayashi. Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 34:1-34:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{baillot_et_al:LIPIcs.CONCUR.2021.34, author = {Baillot, Patrick and Ghyselen, Alexis and Kobayashi, Naoki}, title = {{Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {34:1--34:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.34}, URN = {urn:nbn:de:0030-drops-144111}, doi = {10.4230/LIPIcs.CONCUR.2021.34}, annote = {Keywords: Type Systems, Pi-calculus, Process Calculi, Complexity Analysis, Usages, Sized Types} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Patrick Baillot and Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 9:1-9:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{baillot_et_al:LIPIcs.CSL.2018.9, author = {Baillot, Patrick and Ghyselen, Alexis}, title = {{Combining Linear Logic and Size Types for Implicit Complexity}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.9}, URN = {urn:nbn:de:0030-drops-96763}, doi = {10.4230/LIPIcs.CSL.2018.9}, annote = {Keywords: Implicit computational complexity, lambda-calculus, linear logic, type systems, polynomial time complexity, size types} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Patrick Baillot and Anupam Das. Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 40:1-40:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{baillot_et_al:LIPIcs.CSL.2016.40, author = {Baillot, Patrick and Das, Anupam}, title = {{Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.40}, URN = {urn:nbn:de:0030-drops-65807}, doi = {10.4230/LIPIcs.CSL.2016.40}, annote = {Keywords: proof theory, linear logic, bounded arithmetic, polynomial time computation, implicit computational complexity} }
Published in: LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)
Patrick Baillot and Ugo Dal Lago. Higher-Order Interpretations and Program Complexity. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 62-76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@InProceedings{baillot_et_al:LIPIcs.CSL.2012.62, author = {Baillot, Patrick and Dal Lago, Ugo}, title = {{Higher-Order Interpretations and Program Complexity}}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL}, pages = {62--76}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-42-2}, ISSN = {1868-8969}, year = {2012}, volume = {16}, editor = {C\'{e}gielski, Patrick and Durand, Arnaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.62}, URN = {urn:nbn:de:0030-drops-36641}, doi = {10.4230/LIPIcs.CSL.2012.62}, annote = {Keywords: implicit complexity, higher-order rewriting, quasi-interpretations} }
Feedback for Dagstuhl Publishing