Working Group “Transcendentalist Circle”
Working group on the foundations of logic and computation, especially in the light of Girard’s Transcendental Syntax. We aim for a transdisciplinary interaction between mathematics, computer science and philosophy inspired by the LIGC working group.
We organise meetings and presentations.
Members (21)
- Davide Barbarossa (★ Co-founder)
Lambda-calculus, type theory, linear logic, category theory, classical realizability, Kantian-Girardian philosophy – Università di Bologna
- Hugo Cadière
Philosophy of German idealism (Kant, Hegel, Fichte) and inferantialism (Brandom, Sellars) – Université Lyon 3
- Titouan Carette
Mathematics, quantum computation – Université Paris Saclay
- Baptiste Chanus
Université Paris 1 Panthéon-Sorbonne
- Sidney Congard
Computer science, Verification – Université Paris Cité
- Kostia Chardonnet
Computer science, quantum computation, cyclic proofs – Université Paris Saclay
- Pablo Donato
Sequent calculus, deep inference, type theory, Peirce’s existential graphs, focalization, proof search – Ecole Polytechnique
- Aloÿs Dufour
Category theory, lambda-calculus, categorical semantics, type systems, linear logic, algebraic geometry, homotopy theory – Université Sorbonne Paris Nord
- Boris Eng (★ Co-founder)
Computer science, technical side of the transcendental syntax – Université Sorbonne Paris Nord
- Yannis Hausberg
Philosophy of science – Université Lyon 3
- Jérémy Hervé
- Axel Kerinec
Lambda-calculus, linear logic, type theory – Université Sorbonne Paris Nord
- Valentin Maestracci (★ Co-founder)
Lambda-calculus, type theory, homotopy type theory, Dedukti, directed homotopy theory, rewriting – Università di Bologna
- Julien Marquet
Formal mathematics, verification, type systems, Nix, DevOps – ENS Ulm
- Rémi Nollet
Computer science, cyclic proofs
- Ambroise Lafont
Type Theory and Category Theory – University of Cambridge
- Federico Olimpieri
Computer science, type theory – University of Leeds
- Adrien Ragot
Proof-nets, interaction nets, implicit computational complexity, lambda-calculus, linear logic
- Paul Séjourné
Philosophy (Aristotle, Kant, Deleuze), algebraic geometry, category theory – Université Paris-Sorbonne
- Raphael Tossings
History of modern philosophy (Descartes, Kant, Hegel), Brandom, analytical philosophy – Sorbonne University & Ottawa University
- Tito
Links between linear logic and automata theory / combinatorics / computational complexity / algorithms – Ecole Polytechnique
- Pierre Vial
Metaprogramming in Coq, proof assistants, quantitative intersection type systems, infinitary calculi and coinduction, Lambda-Mu calculus, Semantics of the pure lambda-calculus – ENS Paris-Saclay
Contact me or another member to join our discussions on Zulip.
Next meetings
(Soon)
Past meetings
- “Proof-nets and Deep Inference” (April 27, 2022) by Pablo Donato (5 people).
- “Computation and Meaning” (March 23, 2022) by Boris Eng (8 people).
- “Lambda-calculus and stellar resolution” (March 9, 2022) by Boris Eng and Julien Marquet (6 people).
- Round table discussion at CIRM’s “Logic and Interaction” thematic month (February 2022) with Jean-Baptiste Joinet (8 people).
References on Transcendental Syntax
Relevant resources