The PSG system: from formal language definitions to interactive programming environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling strictness into streams
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On strictness and its analysis
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computation of aliases and support sets
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Lazy evaluation and the logic variable
ICS '88 Proceedings of the 2nd international conference on Supercomputing
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
Verifying the correctness of compiler transformations on basic blocks using abstract interpretation
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A syntactic approach to fixed point computation on finite domains
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
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
Deriving algorithms from type inference systems: application to strictness analysis
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strictness optimization for graph reduction machines (why id might not be strict)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast strictness analysis based on demand propagation
ACM Transactions on Programming Languages and Systems (TOPLAS)
How much non-strictness do lenient programs require?
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
On the power and limitations of strictness analysis
Journal of the ACM (JACM)
Space-efficient scheduling of parallelism with synchronization variables
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Mechanisms for efficient multiprocessor combinator reduction
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Variations on strictness analysis
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
The four-stroke reduction engine
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Context-sensitive rewriting strategies
Information and Computation
Investigation of Algebraic Query Optimisation Techniques for Database Programming Languages
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Algebraic query optimisation for database programming languages
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Software Development Method Based on Abstract Interpretation
IWSSD '98 Proceedings of the 9th international workshop on Software specification and design
A syntactic method for finding least fixed points of higher-order functions over finite domains
Journal of Functional Programming
A policy iteration algorithm for computing fixed points in static analysis of programs
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |