A syntactic approach to fixed point computation on finite domains
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Abstract interpretation in weak powerdomains
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Completeness and predicate-based abstract interpretation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
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
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
Using abstract interpretation to define a strictness type inference system
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Disjunctive program analysis for algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inference of polymorphic and conditional strictness properties
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of computation
Higher-order pattern complement and the strict λ-calculus
ACM Transactions on Computational Logic (TOCL)
Using Template Haskell for Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Making "stricterness" more relevant
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Making "stricterness" more relevant
Higher-Order and Symbolic Computation
Hi-index | 0.01 |