Sam Lindley
Applied Filters
- Sam Lindley
- AuthorRemove filter
People
Colleagues
- Sam Lindley (50)
- James Cheney (10)
- Philip Wadler (10)
- J Garrett Morris (6)
- Daniel Hillerström (5)
- Jeremy Yallop (5)
- Conor Thomas McBride (4)
- Matija Pretnar (3)
- Michel Steuwer (3)
- Ohad Kammar (3)
- Andreas Rossberg (2)
- Christian Fensch (2)
- Christophe Dubach (2)
- Daan Leijen (2)
- Dan R Ghica (2)
- Ezra E K Cooper (2)
- Heiko Müller (2)
- Jan Stolarek (2)
- Nicolas Oury (2)
- Peter Buneman (2)
Roles
Publication
Proceedings/Book Names
- ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (2)
- DAMP '07: Proceedings of the 2007 workshop on Declarative aspects of multicore programming (1)
- Haskell '09: Proceedings of the 2nd ACM SIGPLAN symposium on Haskell (1)
- Haskell '13: Proceedings of the 2013 ACM SIGPLAN symposium on Haskell (1)
- Haskell 2016: Proceedings of the 9th International Symposium on Haskell (1)
- Haskell 2021: Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell (1)
- ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (1)
- ICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (1)
- ML '08: Proceedings of the 2008 ACM SIGPLAN workshop on ML (1)
- PEPM '14: Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation (1)
- PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (1)
- PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (1)
- POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (1)
- Programming Languages and Systems (1)
- SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data (1)
- SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (1)
- TLDI '12: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation (1)
- TyDe 2016: Proceedings of the 1st International Workshop on Type-Driven Development (1)
- WGP '12: Proceedings of the 8th ACM SIGPLAN workshop on Generic programming (1)
- WGP '14: Proceedings of the 10th ACM SIGPLAN workshop on Generic programming (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.
- research-articleOpen AccessPublished By ACMPublished By ACM
Effect Handlers for C via Coroutines
- Mario Alvarez-Picallo
Huawei Research Centre, Edinburgh, United Kingdom
, - Teodoro Freund
Huawei Research Centre, Edinburgh, United Kingdom
, - Dan R. Ghica
Huawei Research Centre, Edinburgh, United Kingdom / University of Birmingham, Birmingham, United Kingdom
, - Sam Lindley
University of Edinburgh, Edinburgh, United Kingdom
Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA2•October 2024, Article No.: 358, pp 2462-2489 • https://doi.org/10.1145/3689798Effect handlers provide a structured means for implementing user-defined, composable, and customisable computational effects, ranging from exceptions to generators to lightweight threads. We introduce libseff, a novel effect handlers library for C, based ...
- 0Citation
- 140
- Downloads
MetricsTotal Citations0Total Downloads140Last 12 Months140Last 6 weeks97- 1
Supplementary Materialmain_extended2.pdf
- Mario Alvarez-Picallo
- research-articleOpen AccessPublished By ACMPublished By ACM
Oxidizing OCaml with Modal Memory Management
- Anton Lorenzen
University of Edinburgh, Edinburgh, United Kingdom
, - Leo White
Jane Street, London, United Kingdom
, - Stephen Dolan
Jane Street, London, United Kingdom
, - Richard A. Eisenberg
Jane Street, NYC, USA
, - Sam Lindley
University of Edinburgh, Edinburgh, United Kingdom
Proceedings of the ACM on Programming Languages, Volume 8, Issue ICFP•August 2024, Article No.: 253, pp 485-514 • https://doi.org/10.1145/3674642Programmers can often improve the performance of their programs by reducing heap allocations: either by allocating on the stack or reusing existing memory in-place. However, without safety guarantees, these optimizations can easily lead to use-after-free ...
- 0Citation
- 448
- Downloads
MetricsTotal Citations0Total Downloads448Last 12 Months448Last 6 weeks182- 1
Supplementary Materialicfp24main-p58-p-archive.zip
- Anton Lorenzen
- research-articleOpen AccessPublished By ACMPublished By ACM
Bringing the WebAssembly Standard up to Speed with SpecTec
- Dongjun Youn
KAIST, Daejeon, South Korea
, - Wonho Shin
KAIST, Daejeon, South Korea
, - Jaehyun Lee
KAIST, Daejeon, South Korea
, - Sukyoung Ryu
KAIST, Daejeon, South Korea
, - Joachim Breitner
Independent, Freiburg, Germany
, - Philippa Gardner
Imperial College London, London, United Kingdom
, - Sam Lindley
University of Edinburgh, Edinburgh, United Kingdom
, - Matija Pretnar
University of Ljubljana, Ljubljana, Slovenia
, - Xiaojia Rao
Imperial College London, London, United Kingdom
, - Conrad Watt
University of Cambridge, Cambridge, United Kingdom
, - Andreas Rossberg
Independent, Munich, Germany
Proceedings of the ACM on Programming Languages, Volume 8, Issue PLDI•June 2024, Article No.: 210, pp 1559-1584 • https://doi.org/10.1145/3656440WebAssembly (Wasm) is a portable low-level bytecode language and virtual machine that has seen increasing use in a variety of ecosystems. Its specification is unusually rigorous – including a full formal semantics for the language – and every new feature ...
- 0Citation
- 552
- Downloads
MetricsTotal Citations0Total Downloads552Last 12 Months552Last 6 weeks110
- Dongjun Youn
- research-articleOpen AccessPublished By ACMPublished By ACM
The Functional Essence of Imperative Binary Search Trees
- Anton Lorenzen
University of Edinburgh, Edinburgh, United Kingdom
, - Daan Leijen
Microsoft Research, Redmond, USA
, - Wouter Swierstra
Utrecht University, Utrecht, Netherlands
, - Sam Lindley
University of Edinburgh, Edinburgh, United Kingdom
Proceedings of the ACM on Programming Languages, Volume 8, Issue PLDI•June 2024, Article No.: 168, pp 518-542 • https://doi.org/10.1145/3656398Algorithms on restructuring binary search trees are typically presented in imperative pseudocode. Understandably so, as their performance relies on in-place execution, rather than the repeated allocation of fresh nodes in memory. Unfortunately, these ...
- 0Citation
- 503
- Downloads
MetricsTotal Citations0Total Downloads503Last 12 Months503Last 6 weeks175
- Anton Lorenzen
- ArticleOpen Access
Scoped Effects as Parameterized Algebraic Theories
- Sam Lindley
https://ror.org/01nrxwf90University of Edinburgh, Edinburgh, UK
, - Cristina Matache
https://ror.org/01nrxwf90University of Edinburgh, Edinburgh, UK
, - Sean Moss
https://ror.org/03angcq70University of Birmingham, Birmingham, UK
, - Sam Staton
https://ror.org/052gg0110University of Oxford, Oxford, UK
, - Nicolas Wu
https://ror.org/041kmwe10Imperial College London, London, UK
, - Zhixuan Yang
https://ror.org/041kmwe10Imperial College London, London, UK
AbstractNotions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the state, ...
- 0Citation
MetricsTotal Citations0
- Sam Lindley
- research-articleOpen AccessPublished By ACMPublished By ACM
Soundly Handling Linearity
- Wenhao Tang
University of Edinburgh, Edinburgh, United Kingdom
, - Daniel Hillerström
Huawei Zurich Research Center, Zürich, Switzerland
, - Sam Lindley
University of Edinburgh, Edinburgh, United Kingdom
, - J. Garrett Morris
University of Iowa, Iowa, USA
Proceedings of the ACM on Programming Languages, Volume 8, Issue POPL•January 2024, Article No.: 54, pp 1600-1628 • https://doi.org/10.1145/3632896We propose a novel approach to soundly combining linear types with multi-shot effect handlers. circear type systems statically ensure that resources such as file handles and communication channels are used exactly once. Effect handlers provide a rich ...
- 3Citation
- 561
- Downloads
MetricsTotal Citations3Total Downloads561Last 12 Months561Last 6 weeks121- 1
Supplementary Materialpopl24main-p261-p-archive.zip
- Wenhao Tang
- research-articleOpen AccessPublished By ACMPublished By ACM
Structural Subtyping as Parametric Polymorphism
- Wenhao Tang
University of Edinburgh, Edinburgh, UK
, - Daniel Hillerström
Huawei Zurich Research Center, Zurich, Switzerland
, - James McKinna
Heriot-Watt University, Edinburgh, UK
, - Michel Steuwer
Techinsche Universität Berlin, Berlin, Germany / University of Edinburgh, Edinburgh, United Kingdom
, - Ornela Dardha
University of Glasgow, Glasgow, UK
, - Rongxiao Fu
University of Edinburgh, Edinburgh, UK
, - Sam Lindley
University of Edinburgh, Edinburgh, UK
Proceedings of the ACM on Programming Languages, Volume 7, Issue OOPSLA2•October 2023, Article No.: 260, pp 1093-1121 • https://doi.org/10.1145/3622836Structural subtyping and parametric polymorphism provide similar flexibility and reusability to programmers. For example, both features enable the programmer to provide a wider record as an argument to a function that expects a narrower one. However, ...
- 0Citation
- 357
- Downloads
MetricsTotal Citations0Total Downloads357Last 12 Months326Last 6 weeks50- 1
Supplementary Materialoopslab23main-p306-p-archive.zip
- Wenhao Tang
- research-articleOpen AccessPublished By ACMPublished By ACM
Continuing WebAssembly with Effect Handlers
- Luna Phipps-Costin
Northeastern University, Boston, USA
, - Andreas Rossberg
Independent, Munich, Germany
, - Arjun Guha
Northeastern University, Boston, USA / Roblox, Boston, USA
, - Daan Leijen
Microsoft Research, Redmond, USA
, - Daniel Hillerström
Huawei Zurich Research Center, Zurich, Switzerland
, - KC Sivaramakrishnan
Tarides, Chennai, India / IIT Madras, Chennai, India
, - Matija Pretnar
University of Ljubljana, Ljubljana, Slovenia / Institute of Mathematics, Physics & Mechanics, Ljubljana, Slovenia
, - Sam Lindley
The University of Edinburgh, Edinburgh, United Kingdom
Proceedings of the ACM on Programming Languages, Volume 7, Issue OOPSLA2•October 2023, Article No.: 238, pp 460-485 • https://doi.org/10.1145/3622814WebAssembly (Wasm) is a low-level portable code format offering near native performance. It is intended as a compilation target for a wide variety of source languages. However, Wasm provides no direct support for non-local control flow features ...
- 6Citation
- 619
- Downloads
MetricsTotal Citations6Total Downloads619Last 12 Months572Last 6 weeks101
- Luna Phipps-Costin
- research-articleOpen AccessPublished By ACMPublished By ACM
High-level effect handlers in C++
- Dan Ghica
Huawei, UK
, - Sam Lindley
University of Edinburgh, UK
, - Marcos Maroñas Bravo
Huawei, UK
, - Maciej Piróg
Huawei, UK
Proceedings of the ACM on Programming Languages, Volume 6, Issue OOPSLA2•October 2022, Article No.: 183, pp 1639-1667 • https://doi.org/10.1145/3563445Effect handlers allow the programmer to implement computational effects, such as custom error handling, various forms of lightweight concurrency, and dynamic binding, inside the programming language. We introduce cpp-effects, a C++ library for effect ...
- 5Citation
- 1,104
- Downloads
MetricsTotal Citations5Total Downloads1,104Last 12 Months512Last 6 weeks59
- Dan Ghica
- research-articleOpen AccessPublished By ACMPublished By ACM
Constraint-based type inference for FreezeML
- Frank Emrich
University of Edinburgh, UK
, - Jan Stolarek
University of Edinburgh, UK
, - James Cheney
University of Edinburgh, UK
, - Sam Lindley
University of Edinburgh, UK
Proceedings of the ACM on Programming Languages, Volume 6, Issue ICFP•August 2022, Article No.: 111, pp 570-595 • https://doi.org/10.1145/3547642FreezeML is a new approach to first-class polymorphic type inference that employs term annotations to control when and how polymorphic types are instantiated and generalised. It conservatively extends Hindley-Milner type inference and was first presented ...
- 1Citation
- 314
- Downloads
MetricsTotal Citations1Total Downloads314Last 12 Months126Last 6 weeks26
- Frank Emrich
- research-articlePublished By ACMPublished By ACM
A Typed Slicing Compilation of the Polymorphic RPC calculus
- Kwanghoon Choi
Chonnam National University, Republic of Korea
, - James Cheney
The University of Edinburgh, United Kingdom
, - Sam Lindley
The University of Edinburgh, United Kingdom
, - Bob Reynders
Chonnam National University, Republic of Korea
PPDP '21: Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming•September 2021, Article No.: 11, pp 1-15• https://doi.org/10.1145/3479394.3479406The polymorphic RPC calculus allows programmers to write succinct multitier programs using polymorphic location constructs. However, until now it lacked an implementation. We develop an experimental programming language based on the polymorphic RPC ...
- 1Citation
- 35
- Downloads
MetricsTotal Citations1Total Downloads35Last 12 Months5
- Kwanghoon Choi
- research-articlePublished By ACMPublished By ACM
Practical normalization by evaluation for EDSLs
- Nachiappan Valliappan
Chalmers University of Technology, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Sam Lindley
University of Edinburgh, UK
Haskell 2021: Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell•August 2021, pp 56-70• https://doi.org/10.1145/3471874.3472983Embedded domain-specific languages (eDSLs) are typically implemented in a rich host language, such as Haskell, using a combination of deep and shallow embedding techniques. While such a combination enables programmers to exploit the execution mechanism ...
- 0Citation
- 171
- Downloads
MetricsTotal Citations0Total Downloads171Last 12 Months36Last 6 weeks4
- Nachiappan Valliappan
- research-articleOpen AccessPublished By ACMPublished By ACM
Effects for efficiency: asymptotic speedup with first-class control
- Daniel Hillerström
University of Edinburgh, UK
, - Sam Lindley
University of Edinburgh, UK / Imperial College London, UK / Heriot-Watt University, UK
, - John Longley
University of Edinburgh, UK
Proceedings of the ACM on Programming Languages, Volume 4, Issue ICFP•August 2020, Article No.: 100, pp 1-29 • https://doi.org/10.1145/3408982We study the fundamental efficiency of delimited control. Specifically, we show that effect handlers enable an asymptotic improvement in runtime complexity for a certain class of functions. We consider the generic count problem using a pure PCF-like base ...
- 2Citation
- 521
- Downloads
MetricsTotal Citations2Total Downloads521Last 12 Months143Last 6 weeks30- 1
Supplementary Materiala100-hillerstrom-presentation.mp4
- Daniel Hillerström
- research-articleOpen AccessPublished By ACMPublished By ACM
FreezeML: complete and easy type inference for first-class polymorphism
- Frank Emrich
University of Edinburgh, UK
, - Sam Lindley
University of Edinburgh, UK / Imperial College London, UK
, - Jan Stolarek
University of Edinburgh, UK / Lodz University of Technology, Poland
, - James Cheney
University of Edinburgh, UK / Alan Turing Institute, UK
, - Jonathan Coates
University of Edinburgh, UK
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation•June 2020, pp 423-437• https://doi.org/10.1145/3385412.3386003ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is limited to a form of polymorphism in which quantifiers can occur only at ...
- 3Citation
- 730
- Downloads
MetricsTotal Citations3Total Downloads730Last 12 Months129Last 6 weeks12
- Frank Emrich
- research-articleOpen AccessPublished By ACMPublished By ACM
Exceptional asynchronous session types: session types without tiers
- Simon Fowler
University of Edinburgh, UK
, - Sam Lindley
University of Edinburgh, UK
, - J. Garrett Morris
University of Kansas, USA
, - Sára Decova
University of Edinburgh, UK
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL•January 2019, Article No.: 28, pp 1-29 • https://doi.org/10.1145/3290341Session types statically guarantee that communication complies with a protocol. However, most accounts of session typing do not account for failure, which means they are of limited use in real applications---especially distributed applications---where ...
- 33Citation
- 1,195
- Downloads
MetricsTotal Citations33Total Downloads1,195Last 12 Months168Last 6 weeks26- 1
Supplementary Materiala28-fowler.webm
- Simon Fowler
- research-articleOpen AccessPublished By ACMPublished By ACM
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control
- Yannick Forster
Saarland University, Germany / University of Cambridge, UK
, - Ohad Kammar
University of Oxford, UK / University of Cambridge, UK
, - Sam Lindley
University of Edinburgh, UK
, - Matija Pretnar
University of Ljubljana, Slovenia
Proceedings of the ACM on Programming Languages, Volume 1, Issue ICFP•September 2017, Article No.: 13, pp 1-29 • https://doi.org/10.1145/3110257We compare the expressive power of three programming abstractions for user-defined computational effects: Plotkin and Pretnar's effect handlers, Filinski's monadic reflection, and delimited control without answer-type-modification. This comparison ...
- 29Citation
- 1,609
- Downloads
MetricsTotal Citations29Total Downloads1,609Last 12 Months197Last 6 weeks36- 1
Supplementary Materialicfp17-main39-s.zip
- Yannick Forster
- research-articlePublished By ACMPublished By ACM
Do be do be do
- Sam Lindley
University of Edinburgh, UK
, - Conor McBride
University of Strathclyde, UK
, - Craig McLaughlin
University of Edinburgh, UK
POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages•January 2017, pp 500-514• https://doi.org/10.1145/3009837.3009897We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar's effect handler abstraction.
Effect ...
Also Published in:
ACM SIGPLAN Notices: Volume 52 Issue 1, January 2017- 66Citation
- 1,017
- Downloads
MetricsTotal Citations66Total Downloads1,017Last 12 Months63Last 6 weeks20
- Sam Lindley
- research-articlePublished By ACMPublished By ACM
Liberating effects with rows and handlers
- Daniel Hillerström
University of Edinburgh, UK
, - Sam Lindley
University of Edinburgh, UK
TyDe 2016: Proceedings of the 1st International Workshop on Type-Driven Development•September 2016, pp 15-27• https://doi.org/10.1145/2976022.2976033Algebraic effects and effect handlers provide a modular abstraction for effectful programming. They support user-defined effects, as in Haskell, in conjunction with direct-style effectful programming, as in ML. They also present a structured interface ...
- 47Citation
- 288
- Downloads
MetricsTotal Citations47Total Downloads288Last 12 Months61Last 6 weeks21
- Daniel Hillerström
- research-articlePublished By ACMPublished By ACM
Embedding session types in Haskell
- Sam Lindley
University of Edinburgh, UK
, - J. Garrett Morris
University of Edinburgh, UK
Haskell 2016: Proceedings of the 9th International Symposium on Haskell•September 2016, pp 133-145• https://doi.org/10.1145/2976002.2976018We present a novel embedding of session-typed concurrency in Haskell. We extend an existing HOAS embedding of linear λ-calculus with a set of core session-typed primitives, using indexed type families to express the constraints of the session typing ...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 12, December 2016- 21Citation
- 304
- Downloads
MetricsTotal Citations21Total Downloads304Last 12 Months7
- Sam Lindley
- research-articlePublished By ACMPublished By ACM
Talking bananas: structural recursion for session types
- Sam Lindley
University of Edinburgh, UK
, - J. Garrett Morris
University of Edinburgh, UK
ICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming•September 2016, pp 434-447• https://doi.org/10.1145/2951913.2951921Session types provide static guarantees that concurrent programs respect communication protocols. We give a novel account of recursive session types in the context of GV, a small concurrent extension of the linear λ-calculus. We extend GV with ...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 9, September 2016- 42Citation
- 427
- Downloads
MetricsTotal Citations42Total Downloads427Last 12 Months20Last 6 weeks1
- Sam Lindley
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 https://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