The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide…
ACM SIGPLAN Lisp Pointers Template
Write in a clean editor, then format for ACM SIGPLAN Lisp Pointers in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
About the ACM SIGPLAN Lisp Pointers format
ACM SIGPLAN Lisp Pointers is a peer-reviewed journal published by ACM, covering Logic, programming, and type systems, Parallel Computing and Optimization Techniques, Formal Methods in Verification.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM SIGPLAN Lisp Pointers 12, 3, Article 45 (2023).
Formats any DOI in ACM SIGPLAN Lisp Pointers style. No sign-up. |
| Publishes research in | Logic, programming, and type systems Parallel Computing and Optimization Techniques Formal Methods in Verification Distributed and Parallel Computing Systems Algorithms and Data Compression |
| ISSN | 1045-3563 |
| h-index | 14 |
| i10-index | 26 |
| Total citations | 1,203 |
| Top institutions publishing here | Massachusetts Institute of Technology |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Papers published in ACM SIGPLAN Lisp Pointers per year
Citation impact of ACM SIGPLAN Lisp Pointers by publication year
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Most-cited papers in ACM SIGPLAN Lisp Pointers
Many modern garbage collectors [4] recover space by copying. Using an initial "root" set of pointers which are stored in known locations, all accessible objects are copied into a "new space". Two of the attractive properties of such a collector are that it results in memory compaction and it can have a running time proportional…
Plotkin's λ-value calculus is sound but incomplete for reasoning about βeegr;-transformations on programs in continuation-passing style (CPS). To find a complete extension, we define a new, compactifying CPS transformation and an “inverse”mapping, un -CPS, both of which are interesting in their own right. Using the new CPS transformation, we can determine the precise language of…
The possibility of incredibly cheap, fantastically large media for storage gives rise to a realistic LISP memory management scheme under which GC may be postponed for days, or even indefinitely; the idea is encapsulated in the acronym "DDI" --- "GC? Don't Do It!". Tertiary memory is used to archive pages of the LISP environment which…
Binding-time improvements aim at making partial evaluation (a.k.a. program specialization) yield a better result. They have been achieved so far mostly by hand-transforming the source program. We observe that as they are better understood, these hand-transformations are progressively integrated into partial evaluators, thereby alleviating the need for source-level binding-time improvements. Control-based binding-time improvements, for example,…