Lazy evaluation and the logic variable
ICS '88 Proceedings of the 2nd international conference on Supercomputing
A collecting interpretation of expressions
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strictness analysis aids time analysis
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using projection analysis of evaluation-order and its application
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A relationship between abstract interpretation and projection analysis
POPL '90 Proceedings of the 17th 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
Program transformation in the presence of errors
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compile-time garbage collection by sharing analysis
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)
Strictness and binding-time analyses: two for the price of one
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Generalized partial computation for a lazy functional language
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Finiteness conditions for fixed point iteration
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
A precise relationship between the deductive power of forward and backward strictness analysis
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
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
Completeness and predicate-based abstract interpretation
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
Safe: a semantic technique for transforming programs in the presence of errors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving properties of programs defined over recursive data structures
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Caching intermediate results for program improvement
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Fast strictness analysis based on demand propagation
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power and limitations of strictness analysis
Journal of the ACM (JACM)
Disjunctive program analysis for algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Static caching for incremental computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Cheap eagerness: speculative evaluation in a lazy functional language
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Efficient abstract interpretation using component-wise homomorphisms
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
A Per Model of Secure Information Flow in Sequential Programs
Higher-Order and Symbolic Computation
A Per Model of Secure Information Flow in Sequential Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Dead Code Elimination through Dependent Types
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Eliminating Dead Code on Recursive Data
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Effective Strictness Analysis with HORN Constraints
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Eliminating dead code on recursive data
Science of Computer Programming - Special issue on static analysis (SAS'99)
Algorithm + strategy = parallelism
Journal of Functional Programming
Smarter garbage collection with simplifiers
Proceedings of the 2006 workshop on Memory system performance and correctness
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Using Template Haskell for Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Goal-directed weakening of abstract interpretation results
ACM Transactions on Programming Languages and Systems (TOPLAS)
Safety of nöcker's strictness analysis
Journal of Functional Programming
A cost semantics for self-adjusting computation
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SAS'10 Proceedings of the 17th international conference on Static analysis
Contracts as pairs of projections
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
On the power of abstract interpretation
Computer Languages
Lenient evaluation is neither strict nor lazy
Computer Languages
Automatic amortised analysis of dynamic memory allocation for lazy functional programs
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Modular, higher-order cardinality analysis in theory and practice
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |