Jean-Jacques Lévy

Affiliations:
  • INRIA, France


According to our database1, Jean-Jacques Lévy authored at least 25 papers between 1973 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle.
CoRR, 2018

2017
Redexes are stable in the λ-calculus.
Math. Struct. Comput. Sci., 2017

A Semi-automatic Proof of Strong Connectivity.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2017

2013
The Cost of Usage in the Lambda-Calculus.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2011
Introduction to the Theory of Programming Languages.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-0-85729-076-2, 2011

2005
Sharing in the Weak Lambda-Calculus.
Proceedings of the Processes, 2005

2001
Introduction - Bohm's theorem: applications to Computer Science Theory - BOTH 2001.
Proceedings of the Bohm's theorem: applications to Computer Science Theory, 2001

2000
An Asynchronous, Distributed Implementation of Mobile Ambients.
Proceedings of the Theoretical Computer Science, 2000

1999
Explicit Substitutions and Programming Languages.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1997
Some Results in the Joint-Calculus.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

1996
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions.
J. ACM, 1996

Analysis and Caching of Dependencies.
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

A Calculus of Mobile Agents.
Proceedings of the CONCUR '96, 1996

1992
The Geometry of Optimal Lambda Reduction.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

An abstract standardisation theorem
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Linear Logic Without Boxes
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991
Explicit Substitutions.
J. Funct. Program., 1991

Computations in Orthogonal Rewriting Systems, II.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

Computations in Orthogonal Rewriting Systems, I.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1979
Minimal and Optimal Computations of Recursive Programs.
J. ACM, 1979

A Survey of Some Syntactic Results in the lambda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1976
An Algebraic Interpretation of the <i> lambda beta </i> K-Calculus; and an Application of a Labelled <i> lambda </i> -Calculus.
Theor. Comput. Sci., 1976

1975
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1973
Mechanizable Proofs about Parallel Processes
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973


  Loading...