A Result on Implications of sigma;1-Sentences and Its Application to Normal Form Theorems. - Jean-Yves Girard 001; Peter Päppinghaus (J. Symb. Log., 1981)

Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs. - Jean-Yves Girard 001; Jacqueline Vauzeilles (Arch. Math. Log., 1984)

Functors and Ordinal Notations. I: A Functorial Construction of the Veblen Hierarchy. - Jean-Yves Girard 001; Jacqueline Vauzeilles (J. Symb. Log., 1984)

Functors and Ordinal Notations. II: A Functorial Construction of the Bachmann Hierarchy. - Jean-Yves Girard 001; Jacqueline Vauzeilles (J. Symb. Log., 1984)

La mouche dans la bouteille. - Jean-Yves Girard 001 (Logic Colloquium, 1985)

Set recursion and Πhalf-logic. - Jean-Yves Girard 001; Dag Normann (Ann. Pure Appl. Log., 1985)

Linear Logic and Parallelism. - Jean-Yves Girard 001 (Mathematical Models for the Semantics of Parallelism, 1986)

Quantitative and Qualitative Semantics (Abstract of Invited Lecture) - Jean-Yves Girard 001 (LICS, 1986)

The System F of Variable Types, Fifteen Years Later. - Jean-Yves Girard 001 (Theor. Comput. Sci., 1986)

Linear Logic and Lazy Computation. - Jean-Yves Girard 001; Yves Lafont (TAPSOFT, Vol.2, 1987)

Linear Logic. - Jean-Yves Girard 001 (Theor. Comput. Sci., 1987)

Geometry of interaction 2: deadlock-free algorithms. - Jean-Yves Girard 001 (Conference on Computer Logic, 1988)

Semantic Parametricity in Polymorphic Lambda Calculus - Peter J. Freyd; Jean-Yves Girard 001; Andre Scedrov; Philip J. Scott (LICS, 1988)

Normal functors, power series and λ-calculus. - Jean-Yves Girard 001 (Ann. Pure Appl. Log., 1988)

Some Uses of Dilators in Combinatorial Problems, II. - V. Michele Abrusci; Jean-Yves Girard 001; Jacques Van de Wiele (J. Symb. Log., 1990)

A New Constructive Logic: Classical Logic. - Jean-Yves Girard 001 (Math. Struct. Comput. Sci., 1991)

Embeddability of PTYKES. - Jean-Yves Girard 001; Dag Normann (J. Symb. Log., 1992)

Logic and Exceptions: A Few Remarks. - Jean-Yves Girard 001 (J. Log. Comput., 1992)

Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. - Jean-Yves Girard 001; Andre Scedrov; Philip J. Scott (Theor. Comput. Sci., 1992)

On the Unity of Logic. - Jean-Yves Girard 001 (Ann. Pure Appl. Log., 1993)

Geometry of Interaction (Abstract). - Jean-Yves Girard 001 (CONCUR, 1994)

Light Linear Logic. - Jean-Yves Girard 001 (Inf. Comput., 1998)

On Denotational Completeness. - Jean-Yves Girard 001 (Theor. Comput. Sci., 1999)

Coherent Banach Spaces: A Continuous Denotational Semantics. - Jean-Yves Girard 001 (Theor. Comput. Sci., 1999)

Conférénce invitée: Négation et dualité en programmation logique. - Jean-Yves Girard 001 (JFPLC, 2000)

Locus Solum: From the rules of logic to the logic of rules. - Jean-Yves Girard 001 (Math. Struct. Comput. Sci., 2001)

From foundations to ludics. - Jean-Yves Girard 001 (Bull. Symb. Log., 2003)

Preface. - Jean-Yves Girard 001; Mitsuhiro Okada; Andre Scedrov (Theor. Comput. Sci., 2003)

Truth, modality and intersubjectivity. - Jean-Yves Girard 001 (Math. Struct. Comput. Sci., 2007)

Geometry of Interaction V: Logic in the hyperfinite factor. - Jean-Yves Girard 001 (Theor. Comput. Sci., 2011)

Normativity in Logic. - Jean-Yves Girard 001 (Epistemology versus Ontology, 2012)

Three lightings of logic (Invited Talk). - Jean-Yves Girard 001 (CSL, 2013)

Transcendental syntax I: deterministic case. - Jean-Yves Girard 001 (Math. Struct. Comput. Sci., 2017)

Transcendental Syntax iv: Logic Without Systems. - Jean-Yves Girard 001 (Logic, Language, and Security, 2020)