default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Jacques Lévy
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[p1]Jean-Jacques Lévy:
Tracking Redexes in the Lambda Calculus. The French School of Programming 2024: 241-264
2010 – 2019
- 2019
- [c20]Ran Chen, Cyril Cohen
, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle. ITP 2019: 13:1-13:19 - 2018
- [i1]Ran Chen, Cyril Cohen, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle. CoRR abs/1810.11979 (2018) - 2017
- [j5]Jean-Jacques Lévy:
Redexes are stable in the λ-calculus. Math. Struct. Comput. Sci. 27(5): 738-750 (2017) - [c19]Ran Chen, Jean-Jacques Lévy:
A Semi-automatic Proof of Strong Connectivity. VSTTE 2017: 49-65 - 2013
- [c18]Andrea Asperti, Jean-Jacques Lévy:
The Cost of Usage in the Lambda-Calculus. LICS 2013: 293-300 - 2011
- [b1]Gilles Dowek, Jean-Jacques Lévy:
Introduction to the Theory of Programming Languages. Undergraduate Topics in Computer Science, Springer 2011, ISBN 978-0-85729-075-5, pp. I-XI, 1-96
2000 – 2009
- 2005
- [c17]Tomasz Blanc, Jean-Jacques Lévy, Luc Maranget:
Sharing in the Weak Lambda-Calculus. Processes, Terms and Cycles 2005: 70-87 - 2004
- [e3]Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell:
Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. IFIP 155, Kluwer/Springer 2004, ISBN 1-4020-8140-5 [contents] - 2001
- [c16]Jean-Jacques Lévy:
Introduction - Bohm's theorem: applications to Computer Science Theory - BOTH 2001. BOTH 2001: 196-197 - [e2]Jean-Jacques Lévy:
Bohm's theorem: applications to Computer Science Theory, BOTH 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 2001. Electronic Notes in Theoretical Computer Science 50(2), Elsevier 2001 [contents] - 2000
- [c15]Cédric Fournet, Jean-Jacques Lévy, Alan Schmitt:
An Asynchronous, Distributed Implementation of Mobile Ambients. IFIP TCS 2000: 348-364
1990 – 1999
- 1999
- [c14]Jean-Jacques Lévy, Luc Maranget:
Explicit Substitutions and Programming Languages. FSTTCS 1999: 181-200 - 1997
- [c13]Jean-Jacques Lévy:
Some Results in the Joint-Calculus. TACS 1997: 233-249 - 1996
- [j4]Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy:
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM 43(2): 362-397 (1996) - [c12]Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy:
A Calculus of Mobile Agents. CONCUR 1996: 406-421 - [c11]Martín Abadi, Butler W. Lampson, Jean-Jacques Lévy:
Analysis and Caching of Dependencies. ICFP 1996: 83-91 - 1995
- [e1]Kanchana Kanchanasut, Jean-Jacques Lévy:
Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, December 11-13, 1995, Proceedings. Lecture Notes in Computer Science 1023, Springer 1995, ISBN 3-540-60688-2 [contents] - 1992
- [c10]Georges Gonthier, Jean-Jacques Lévy, Paul-André Melliès:
An abstract standardisation theorem. LICS 1992: 72-81 - [c9]Georges Gonthier, Martín Abadi, Jean-Jacques Lévy:
Linear Logic Without Boxes. LICS 1992: 223-234 - [c8]Georges Gonthier, Martín Abadi, Jean-Jacques Lévy:
The Geometry of Optimal Lambda Reduction. POPL 1992: 15-26 - 1991
- [j3]Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy:
Explicit Substitutions. J. Funct. Program. 1(4): 375-416 (1991) - [c7]Gérard P. Huet, Jean-Jacques Lévy:
Computations in Orthogonal Rewriting Systems, I. Computational Logic - Essays in Honor of Alan Robinson 1991: 395-414 - [c6]Gérard P. Huet, Jean-Jacques Lévy:
Computations in Orthogonal Rewriting Systems, II. Computational Logic - Essays in Honor of Alan Robinson 1991: 415-443 - 1990
- [c5]Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy:
Explicit Substitutions. POPL 1990: 31-46
1970 – 1979
- 1979
- [j2]Gérard Berry, Jean-Jacques Lévy:
Minimal and Optimal Computations of Recursive Programs. J. ACM 26(1): 148-175 (1979) - [c4]Gérard Berry, Jean-Jacques Lévy:
A Survey of Some Syntactic Results in the lambda-Calculus. MFCS 1979: 552-566 - 1977
- [c3]Gérard Berry, Jean-Jacques Lévy:
Minimal and Optimal Computations of Recursive Programs. POPL 1977: 215-226 - 1976
- [j1]Jean-Jacques Lévy:
An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus. Theor. Comput. Sci. 2(1): 97-114 (1976) - 1975
- [c2]Jean-Jacques Lévy:
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 147-165 - 1973
- [c1]Jean-Marie Cadiou, Jean-Jacques Lévy:
Mechanizable Proofs about Parallel Processes. SWAT 1973: 34-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
