Strictness analysis and polymorphic invariance
on Programs as data objects
The theory of strictness analysis for higher order functions
on Programs as data objects
Projections for strictness analysis
Proc. of a conference on Functional programming languages and computer architecture
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Binding time analysis for high order untyped functional languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Frontiers and open sets in abstract interpretation
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
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
Binding time analysis: a new PERspective
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Research topics in functional programming
A strongly-typed self-applicable partial evaluator
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Head-strictness is not a monotonic abstract property
Information Processing Letters
Binding Time Analysis for Polymorphically Typed Higher Order Languages
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Backwards Strictness Analysis: Proved and Improved
Proceedings of the 1989 Glasgow Workshop on Functional Programming
A Note on the Choice of Domains for Projection-Based Program Analysis
Proceedings of the 1991 Glasgow Workshop on Functional Programming
Fast strictness analysis based on demand propagation
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |