Pierre Louis Curien
Applied Filters
- Pierre Louis Curien
- AuthorRemove filter
People
Colleagues
- Giorgio Ghelli (7)
- Guy Cousineau (4)
- Martín Abadi (4)
- Jean Jacques Lévy (3)
- L. Cardelli (3)
- Michel Mauny (3)
- Ascander Suarez (2)
- Claudia Faggian (2)
- Gérard Berry (2)
- Giorgio Ausiello (2)
- Grzegorz Rozenberg (2)
- Guillaume Munch-Maccagnoni (2)
- Hugo Herbelin (2)
- Lila Kari (2)
- Marcelo P Fiore (2)
- Min Zhang (2)
- Roberto Di Cosmo (2)
- Roberto M Amadio (2)
- Thérèse Hardin (2)
Publication
Journal/Magazine Names
- Theoretical Computer Science (10)
- Information and Computation (4)
- Mathematical Structures in Computer Science (3)
- ACM SIGPLAN Notices (2)
- Electronic Notes in Theoretical Computer Science (ENTCS) (1)
- Fundamenta Informaticae (1)
- Information and Control (1)
- Journal of Computer Science and Technology (1)
- Journal of the ACM (1)
- Science of Computer Programming (1)
Proceedings/Book Names
- Algebraic methods in semantics (2)
- CAAP '90: Proceedings of the fifteenth colloquium on CAAP'90 (1)
- Categorical combinators, sequential algorithms, and functional programming (2nd ed.) (1)
- CSL '08: Proceedings of the 22nd international workshop on Computer Science Logic (1)
- CSL'05: Proceedings of the 19th international conference on Computer Science Logic (1)
- Domains and lambda-calculi (1)
- Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science) (1)
- ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (1)
- LICS '19: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (1)
- POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1)
- POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1)
- POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1)
- Proc. of a conference on Functional programming languages and computer architecture (1)
- Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85) (1)
- Proc. of the thirteenth spring school of the LITP on Combinators and functional programming languages (1)
- Proceedings of the 18th international colloquium on Automata, languages and programming (1)
- Proceedings of the Thirteenth Spring School of the LITP on Combinators and Functional Programming Languages (1)
- Proof, language, and interaction (1)
- RTA-91: Proceedings of the 4th international conference on Rewriting techniques and applications (1)
- Theoretical aspects of object-oriented programming (1)
Publisher
- Springer-Verlag (20)
- Elsevier Science Publishers Ltd. (10)
- Association for Computing Machinery (7)
- Cambridge University Press (7)
- Academic Press, Inc. (4)
- MIT Press (2)
- Academic Press Professional, Inc. (1)
- Birkhauser Boston Inc. (1)
- Elsevier North-Holland, Inc. (1)
- Elsevier Science Publishers B. V. (1)
- IEEE Press (1)
- IOS Press (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- brief-report
Explicit substitutions: A short survey
Pierre-Louis Curien
LIENS, CNRS-Ecole Normale Supérieure, Paris, France
Journal of Computer Science and Technology, Volume 13, Issue 6•Nov 1998, pp 562-563 • https://doi.org/10.1007/BF02946499- 0Citation
MetricsTotal Citations0
- editorial
Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu
Yijia Chen
Shanghai Jiao Tong University, China
,Pierre-Louis Curien
IRIF, Université Paris Cité, France
,Yuxin Deng
East China Normal University, China
,Min Zhang
East China Normal University, China
Theoretical Computer Science, Volume 945, Issue C•Feb 2023 • https://doi.org/10.1016/j.tcs.2023.113720- 0Citation
MetricsTotal Citations0
- research-article
A sequent calculus for opetopes
Cédric Ho Thanh
University of Paris, France
,Pierre-Louis Curien
University of Paris, France
,Samuel Mimram
Palaiseau, France
LICS '19: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science•June 2019, Article No.: 13, pp 1-12Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak ω-categories, which was the ...
- 0Citation
- 14
- Downloads
MetricsTotal Citations0Total Downloads14Last 12 Months1
- research-article
Published By ACM
Published By ACM
A theory of effects and resources: adjunction models and polarised calculi
Pierre-Louis Curien
University of Paris Diderot, France / Inria, France
,Marcelo Fiore
University of Cambridge, UK
,Guillaume Munch-Maccagnoni
University of Cambridge, UK
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages•January 2016, pp 44-56• https://doi.org/10.1145/2837614.2837652We consider the Curry-Howard-Lambek correspondence for effectful computation and resource management, specifically proposing polarised calculi together with presheaf-enriched adjunction models as the starting point for a comprehensive semantic theory ...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 1, January 2016- 31Citation
- 347
- Downloads
MetricsTotal Citations31Total Downloads347Last 12 Months40Last 6 weeks1
- article
Revisiting the categorical interpretation of dependent type theory
Pierre-Louis Curien
πr2 team, PPS Laboratory, CNRS, Université Paris Diderot, and INRIA, France
,Richard Garner
Macquarie University, Sydney, Australia
,Martin Hofmann
Ludwig-Maximilian's-Universität, München, Germany
Theoretical Computer Science, Volume 546•August, 2014, pp 99-119 • https://doi.org/10.1016/j.tcs.2014.03.003We show that Hofmann's and Curien's interpretations of Martin-Lof's type theory, which were both designed to cure a mismatch between syntax and semantics in Seely's original interpretation in locally cartesian closed categories, are related via a ...
- 1Citation
MetricsTotal Citations1
- article
An approach to innocent strategies as graphs
Pierre-Louis Curien
CNRS and Université Paris Diderot - Paris 7, Paris, France
,Claudia Faggian
CNRS and Université Paris Diderot - Paris 7, Paris, France
Information and Computation, Volume 214•May, 2012, pp 119-155 • https://doi.org/10.1016/j.ic.2011.12.006This paper proposes an approach for extending to graphs the close relation between proofs and innocent strategies. We work in the setting of L-nets, introduced by Faggian and Maurel as a game model of concurrent interaction. We show how L-nets ...
- 2Citation
MetricsTotal Citations2
- research-article
Preface
Pierre-Louis Curien
Laboratoire Preuves, Programmes et Systèmes
Theoretical Computer Science, Volume 412, Issue 20•April, 2011, pp 1853-1859 • https://doi.org/10.1016/j.tcs.2010.12.015- 0Citation
MetricsTotal Citations0
- Article
The Joy of String Diagrams
Pierre-Louis Curien
Preuves, Programmes et Systèmes, CNRS and University Paris 7,
CSL '08: Proceedings of the 22nd international workshop on Computer Science Logic•September 2008, pp 15-22• https://doi.org/10.1007/978-3-540-87531-4_2In the past recent years, I have been using string diagrams to teach basic category theory (adjunctions, Kan extensions, but also limits and Yoneda embedding). Using graphical notations is undoubtedly joyful, and brings us close to other graphical ...
- 0Citation
MetricsTotal Citations0
- article
Computational self-assembly
Pierre-Louis Curien
CNRS & Université Paris-Diderot, France
,Vincent Danos
CNRS & Université Paris-Diderot, France and University of Edinburgh, United Kingdom
,Jean Krivine
École Polytechnique, France
,Min Zhang
East China Normal University, China
Theoretical Computer Science, Volume 404, Issue 1-2•September, 2008, pp 61-75 • https://doi.org/10.1016/j.tcs.2008.04.014The object of this paper is to probe the computational limits of an applied concurrent language called @k. This language describes how agents can bind and modify each other. It is meant as a syntactic medium to build, discuss and execute descriptions of ...
- 3Citation
MetricsTotal Citations3
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove ...
- 7Citation
MetricsTotal Citations7
- article
Definability and Full Abstraction
Pierre-Louis Curien
PPS, CNRS and University Paris 7
Electronic Notes in Theoretical Computer Science (ENTCS), Volume 172•April, 2007, pp 301-310 • https://doi.org/10.1016/j.entcs.2007.02.011Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, ...
- 17Citation
MetricsTotal Citations17
- Article
L-Nets, strategies and proof-nets
Pierre-Louis Curien
CNRS – Université Paris 7
,Claudia Faggian
Universitá di Padova
CSL'05: Proceedings of the 19th international conference on Computer Science Logic•August 2005, pp 167-183• https://doi.org/10.1007/11538363_13We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard's Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be ...
- 10Citation
MetricsTotal Citations10
- article
Une brève biographie scientifique de Maurice Nivat
Pierre-Louis Curien
Univ. Paris 7, Paris, France
- 0Citation
MetricsTotal Citations0
- research-article
Une brève biographie scientifique de Maurice Nivat
Pierre-Louis Curien
PPS-Case 7014, Univ. Paris 7, 2 pl. Jussieu, F-75251 Paris Cedex 05, France
- 0Citation
MetricsTotal Citations0
- article
Preface to Locus Solum
Pierre-Louis Curien
BOGUS
Mathematical Structures in Computer Science, Volume 11, Issue 3•June 2001, pp 299-300 • https://doi.org/10.1017/S0960129501003371The theory presented here is a new, radical step in the research program that started with linear logic and aiming at an interactive, resource and space conscious account of reasoning and programming.
- 0Citation
MetricsTotal Citations0
- Article
Abstract Machines, Control, and Sequents
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures•September 2000, pp 123-136We describe simple call-by-value and call-by-name abstract machines, expressed with the help of Felleisen's evaluation contexts, for a toy functional language. Then we add a simple control operator and extend the abstract machines accordingly. We give ...
- 1Citation
MetricsTotal Citations1
- Articlefree
Published By ACM
Published By ACM
The duality of computation
Pierre-Louis Curien
CNRS and University Paris 7, 2 place Jussieu, F-75251 Paris Cedex 05
,Hugo Herbelin
INRIA, Domaine de Voluceau, F-78153 Rocquencourt Cedex
ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming•September 2000, pp 233-243• https://doi.org/10.1145/351240.351262We present the μ -calculus, a syntax for λ-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived from implicational Gentzen's sequent calculus LK, a key classical ...
Also Published in:
ACM SIGPLAN Notices: Volume 35 Issue 9, Sept. 2000- 292Citation
- 1,190
- Downloads
MetricsTotal Citations292Total Downloads1,190Last 12 Months214Last 6 weeks46
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner