About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
ACM SIGPLAN Lisp Pointers
›
top-articles
ACM SIGPLAN Lisp Pointers
0.1
(top 100%)
impact factor
217
(top 50%)
papers
612
(top 50%)
citations
9
(top 50%)
h
-index
0.1
(top 100%)
extended IF
239
all documents
655
doc citations
20
(top 50%)
g
-index
Top Articles
#
Title
Journal
Year
Citations
1
Revised 4 report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
1991
183
2
Compacting garbage collection with ambiguous roots
ACM SIGPLAN Lisp Pointers
1988
33
3
Reasoning about programs in continuation-passing style.
ACM SIGPLAN Lisp Pointers
1992
26
4
Set-based analysis of ML programs
ACM SIGPLAN Lisp Pointers
1994
18
5
A calculus for overloaded functions with subtyping
ACM SIGPLAN Lisp Pointers
1992
16
6
Macros in Scheme
ACM SIGPLAN Lisp Pointers
1991
16
7
Hygienic macros through explicit renaming
ACM SIGPLAN Lisp Pointers
1991
13
8
Address/memory management for a gigantic LISP environment or, GC considered harmful
ACM SIGPLAN Lisp Pointers
1987
9
9
Safe fusion of functional expressions
ACM SIGPLAN Lisp Pointers
1992
9
10
Back to direct style II
ACM SIGPLAN Lisp Pointers
1992
9
11
An operational semantics for Scheme
ACM SIGPLAN Lisp Pointers
1992
9
12
The why of Y
ACM SIGPLAN Lisp Pointers
1988
9
13
The Boyer Benchmark at warp speed
ACM SIGPLAN Lisp Pointers
1992
9
14
Preliminary report on a practical type inference system for common Lisp
ACM SIGPLAN Lisp Pointers
1987
8
15
Improving binding times without explicit CPS-conversion
ACM SIGPLAN Lisp Pointers
1992
8
16
Continuation-based partial evaluation
ACM SIGPLAN Lisp Pointers
1994
8
17
A package for handling units of measure in Lisp
ACM SIGPLAN Lisp Pointers
1992
8
18
A guided tour of the Common Lisp interface manager
ACM SIGPLAN Lisp Pointers
1990
8
19
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
1993
8
20
A library of high level control operators
ACM SIGPLAN Lisp Pointers
1993
8
21
Global analysis for partitioning non-strict programs into sequential threads
ACM SIGPLAN Lisp Pointers
1992
7
22
Tag-free garbage collection using explicit type parameters
ACM SIGPLAN Lisp Pointers
1994
7
23
Static dependent costs for estimating execution time
ACM SIGPLAN Lisp Pointers
1994
7
24
Foreign functions and common Lisp
ACM SIGPLAN Lisp Pointers
1987
7
25
Unrolling lists
ACM SIGPLAN Lisp Pointers
1994
6
26
Space-efficient closure representations
ACM SIGPLAN Lisp Pointers
1994
6
27
Parametric type classes
ACM SIGPLAN Lisp Pointers
1992
6
28
Pragmatic parsing in Common Lisp; or, putting defmacro on steroids
ACM SIGPLAN Lisp Pointers
1991
5
29
Polymorphic type reconstruction for garbage collection without tags
ACM SIGPLAN Lisp Pointers
1992
5
30
A foundation for an efficient multi-threaded scheme system
ACM SIGPLAN Lisp Pointers
1992
5
31
Performing Lisp analysis of the FANNKUCH benchmark
ACM SIGPLAN Lisp Pointers
1994
5
32
A syntactic closures macro facility
ACM SIGPLAN Lisp Pointers
1991
5
33
Type inference in the presence of overloading, subtyping and recursive types
ACM SIGPLAN Lisp Pointers
1992
5
34
Metacircular semantics for common Lisp special forms
ACM SIGPLAN Lisp Pointers
1992
5
35
On listing list prefixes
ACM SIGPLAN Lisp Pointers
1989
5
36
XREF
ACM SIGPLAN Lisp Pointers
1987
4
37
Proving memory management invariants for a language based on linear logic
ACM SIGPLAN Lisp Pointers
1992
4
38
Proving the correctness of storage representations
ACM SIGPLAN Lisp Pointers
1992
4
39
Global tagging optimization by type inference
ACM SIGPLAN Lisp Pointers
1992
4
40
Lambda, the ultimate label or a simple optimizing compiler for Scheme
ACM SIGPLAN Lisp Pointers
1994
4
41
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
ACM SIGPLAN Lisp Pointers
1994
4
42
Parallelism in Lisp
ACM SIGPLAN Lisp Pointers
1995
4
43
The buried binding and dead binding problems of Lisp 1.5
ACM SIGPLAN Lisp Pointers
1992
4
44
Efficient implementation of bit-vector operation in Common Lisp
ACM SIGPLAN Lisp Pointers
1990
4
45
The scheme of things
ACM SIGPLAN Lisp Pointers
1990
4
46
Caching considerations for generational garbage collection
ACM SIGPLAN Lisp Pointers
1992
4
47
The scheme of things
ACM SIGPLAN Lisp Pointers
1992
4
48
A programmer's guide to common Lisp
ACM SIGPLAN Lisp Pointers
1987
3
49
Supporting the regression testing in Lisp programs
ACM SIGPLAN Lisp Pointers
1991
3
50
Implementation of a “Lisp comprehension” macro
ACM SIGPLAN Lisp Pointers
1991
3
site/software ©
exaly
; All materials licenced under
CC by-SA
.