Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Abstract interpretation of denotational definitions
3rd annual symposium on theoretical aspects of computer science on STACS 86
Data flow analysis of applicative programs using minimal function graphs
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Strong Abstract Interpretation Using Power Domains (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Automatic binding time analysis for a typed &lgr;-calculus
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context information for lazy code generation
LFP '90 Proceedings of the 1990 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
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
A theory of abstract interpretation [CoCo79] is developed for a typed &lgr;-calculus. The typed &lgr;-calculus is the “static” part of a two-level denotational metalanguage for which abstract interpretation was developed in [Nie86]. The present development relaxes a condition imposed in [Nie86] and this suffices to make the framework applicable to strictness analysis for the &lgr;-calculus. This shows the possibility of a general theory (and hence a system) for the analysis of functional programs. Furthermore, it gives more insight into the relative precision of the various analyses. In particular, it is shown that a collecting (static [CoCo79]) semantics exists, thus answering a problem left open in [BHA86].