Compiling strictness into streams
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A collecting interpretation of expressions
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Small domains spell fast strictness analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Frontiers and open sets in abstract interpretation
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Compilation as partitioning: a new approach to compiling non-strict functional languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
On the power and limitation of strictness analysis based on abstract interpretation
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Collecting interpretations of expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tag-free garbage collection for strongly typed programming languages
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Reference escape analysis: optimizing reference counting based on the lifetime of references
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Global analysis for partitioning non-strict programs into sequential threads
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Compile-time analysis of parallel programs that share memory
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order binding-time analysis
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Polymorphic strictness analysis using frontiers
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Strictness analysis using abstract reduction
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
An efficient approach to computing fixpoints for complex program analysis
ICS '94 Proceedings of the 8th international conference on Supercomputing
Fast strictness analysis based on demand propagation
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power and limitations of strictness analysis
Journal of the ACM (JACM)
Non-determinism Analysis in a Parallel-Functional Language
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
A Polynomial-Cost Non-determinism Analysis
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Non-determinism analyses in a parallel-functional language
Journal of Functional Programming
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Using Template Haskell for Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Safety of nöcker's strictness analysis
Journal of Functional Programming
Deciding kCFA is complete for EXPTIME
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Making "stricterness" more relevant
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
SAS'10 Proceedings of the 17th international conference on Static analysis
Making "stricterness" more relevant
Higher-Order and Symbolic Computation
Correctness of non-determinism analyses in a parallel-functional language
IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
On the power of abstract interpretation
Computer Languages
Lenient evaluation is neither strict nor lazy
Computer Languages
| Hi-index | 0.00 |