Olivier Laurent

Affiliations:
  • Université de Lyon, France


According to our database1, Olivier Laurent authored at least 26 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Type Isomorphisms for Multiplicative-Additive Linear Logic.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021
An anti-locally-nameless approach to formalizing quantifiers.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

2020
Polynomial time in untyped elementary linear logic.
Theor. Comput. Sci., 2020

Super Exponentials in Linear Logic.
Proceedings of the Proceedings Second Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2020

2019
Resource-Tracking Concurrent Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Intersection Subtyping with Constructors.
Proceedings of the Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, 2018

Around Classical and Intuitionistic Linear Logics.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Focusing in Orthologic.
Log. Methods Comput. Sci., 2017

2012
Intersection Types with Subtyping by Means of Cut Elimination.
Fundam. Informaticae, 2012

2011
Intuitionistic Dual-intuitionistic Nets.
J. Log. Comput., 2011

2010
An exact correspondence between a typed pi-calculus and polarised proof-nets.
Theor. Comput. Sci., 2010

Interpreting a finitary pi-calculus in differential interaction nets.
Inf. Comput., 2010

Game semantics for first-order logic
Log. Methods Comput. Sci., 2010

Acyclic Solos and Differential Interaction Nets
Log. Methods Comput. Sci., 2010

2008
Cut Elimination for Monomial MALL Proof Nets.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Quantitative Game Semantics for Linear Logic.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

The Anatomy of Innocence Revisited.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Syntax vs. semantics: A polarized approach.
Theor. Comput. Sci., 2005

Classical isomorphisms of types.
Math. Struct. Comput. Sci., 2005

Polarized and focalized linear and classical proofs.
Ann. Pure Appl. Log., 2005

2004
Polarized games.
Ann. Pure Appl. Log., 2004

2003
Polarized proof-nets and lambda-µ-calculus.
Theor. Comput. Sci., 2003

About Translations of Classical Logic into Polarized Linear Logic.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2001
A Token Machine for Full Geometry of Interaction.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999
Polarized Proof-Nets: Proof-Nets for LC.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999


  Loading...