Thomas Seiller
Publications
Publications
|
|
Agafonov's theorem for probabilistic selectorsMathematical Foundations of Computer Science, Aug 2024, Bratislava, Slovakia. pp.67:1-67:15, ⟨10.4230/LIPIcs.MFCS.2024.67⟩ |
|
|
Linear realisability over nets and second order quantificationTrends in Linear Logic and Applications, Jul 2023, Rome, Italy |
|
|
Distributing and Parallelizing Non-canonical LoopsVerification, Model Checking, and Abstract Interpretation (VMCAI 2023), Jan 2023, Boston (MA), United States. ⟨10.1007/978-3-031-24950-1_1⟩ |
|
|
Linear Realisability and CobordismsFSCD, Sapienza Università Di Roma, Jul 2023, Rome, Italy |
|
|
pymwp: A Static Analyzer Determining Polynomial Growth BoundsAutomated Technology for Verification and Analysis (ATVA 2023), Oct 2023, Singapour, France. ⟨10.1007/978-3-031-45332-8_14⟩ |
|
|
A cartesian bicategory of polynomial functors in homotopy type theory37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021), Aug 2021, Salzburg, Austria |
|
|
A gentle introduction to Girard's Transcendental Syntax5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy |
|
|
Unary Resolution: Characterizing Ptime.Foundations of Software Science and Computation Structures (FOSSACS), Apr 2016, Eindhoven, Netherlands. pp.373-389, ⟨10.1007/978-3-662-49630-5_22⟩ |
|
|
Interaction Graphs: Full Linear LogicIEEE/ACM Logic in Computer Science (LICS) 2016, Jul 2016, New-York, United States. ⟨10.1145/2933575.2934568⟩ |
|
|
An Intensionally Fully-abstract Sheaf Model for pi6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, Nimègue, Netherlands. pp.86--100, ⟨10.4230/LIPIcs.CALCO.2015.86⟩ |
|
|
Logic Programming and Logarithmic Space12th Asian Symposium, APLAS 2014, Oct 2014, Singapour, Singapore. pp.39-57, ⟨10.1007/978-3-319-12736-1_3⟩ |
Loop Quasi-Invariant Chunk DetectionAutomated Technology for Verification and Analysis. ATVA 2017, pp.91-108, 2017, ⟨10.1007/978-3-319-68167-2_7⟩ |
|
|
|
On the computational meaning of axiomsEpistemology, Knowledge and the Impact of Interaction, 38, Springer, pp. 141-184, 2016, Logic, Epistemology, and the Unity of Science, 978-3-319-26504-9. ⟨10.1007/978-3-319-26506-3_5⟩ |
Verificationism and classical realizabilityPerspectives on Interrogative Models of Inquiry, 8, Springer, pp.163-197, 2016, Logic, Argumentation & Reasoning, 978-3-319-20761-2. ⟨10.1007/978-3-319-20762-9_9⟩ |
|
|
Section 06 Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitationsCNRS. 2025, pp.1-20 |
|
|
Memoization for Unary Logic Programming: Characterizing PTIME[Research Report] RR-8796, INRIA Grenoble - Rhône-Alpes; Université Paris-Est, LACL (EA 4219), UPEC, F-94010 Créteil, France; Aix Marseille Université, CNRS, Centrale Marseille, I2M UMR 7373, 13453, Marseille, France; IHÉS. 2015, pp.28 |
|
|
Logique dans le Facteur Hyperfini: Géométrie de l'Interaction et ComplexitéLogique [math.LO]. Aix-Marseille Université, 2012. Français. ⟨NNT : ⟩ |
|
|
Mathematical InformaticsDiscrete Mathematics [cs.DM]. Université Sorbonne Paris Nord, 2024 |