Jean-Yves Girard

Affiliations:
  • Institut de Mathématiques de Marseille, Campus de Luminy, France
  • Paris Diderot University (Paris VII), France (former)


According to our database1, Jean-Yves Girard authored at least 34 papers between 1981 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Transcendental Syntax iv: Logic Without Systems.
Proceedings of the Logic, 2020

2017
Transcendental syntax I: deterministic case.
Math. Struct. Comput. Sci., 2017

2013
Three lightings of logic (Invited Talk).
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Normativity in Logic.
Proceedings of the Epistemology versus Ontology, 2012

2011
Geometry of Interaction V: Logic in the hyperfinite factor.
Theor. Comput. Sci., 2011

2007
Truth, modality and intersubjectivity.
Math. Struct. Comput. Sci., 2007

2003
Preface.
Theor. Comput. Sci., 2003

From foundations to ludics.
Bull. Symb. Log., 2003

2001
Locus Solum: From the rules of logic to the logic of rules.
Math. Struct. Comput. Sci., 2001

2000
Conférénce invitée: Négation et dualité en programmation logique.
Proceedings of the Programmation en logique avec contraintes, 2000

1999
Coherent Banach Spaces: A Continuous Denotational Semantics.
Theor. Comput. Sci., 1999

On Denotational Completeness.
Theor. Comput. Sci., 1999

1998
Light Linear Logic.
Inf. Comput., 1998

1994
Geometry of Interaction (Abstract).
Proceedings of the CONCUR '94, 1994

1993
On the Unity of Logic.
Ann. Pure Appl. Log., 1993

1992
Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability.
Theor. Comput. Sci., 1992

Logic and Exceptions: A Few Remarks.
J. Log. Comput., 1992

Embeddability of PTYKES.
J. Symb. Log., 1992

1991
A New Constructive Logic: Classical Logic.
Math. Struct. Comput. Sci., 1991

1990
Some Uses of Dilators in Combinatorial Problems, II.
J. Symb. Log., 1990

1988
Normal functors, power series and λ-calculus.
Ann. Pure Appl. Log., 1988

Semantic Parametricity in Polymorphic Lambda Calculus
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Geometry of interaction 2: deadlock-free algorithms.
Proceedings of the COLOG-88, 1988

1987
Linear Logic.
Theor. Comput. Sci., 1987

Linear Logic and Lazy Computation.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
The System F of Variable Types, Fifteen Years Later.
Theor. Comput. Sci., 1986

Quantitative and Qualitative Semantics (Abstract of Invited Lecture)
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Linear Logic and Parallelism.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1985
Set recursion and Πhalf-logic.
Ann. Pure Appl. Log., 1985

La mouche dans la bouteille.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1984
Functors and Ordinal Notations. II: A Functorial Construction of the Bachmann Hierarchy.
J. Symb. Log., 1984

Functors and Ordinal Notations. I: A Functorial Construction of the Veblen Hierarchy.
J. Symb. Log., 1984

Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs.
Arch. Math. Log., 1984

1981
A Result on Implications of sigma;<sub>1</sub>-Sentences and Its Application to Normal Form Theorems.
J. Symb. Log., 1981


  Loading...