Strictness analysis—a practical approach
Proc. of a conference on Functional programming languages and computer architecture
Strictness analysis: a new perspective based on type inference
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
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Reasoning about simple and exhaustive demand in higher-order lazy languages
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Strictness analysis in logical form
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Efficient type inference for higher-order binding-time analysis
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
A syntactic approach to fixed point computation on finite domains
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Approximate fixed points in abstract interpretation
ESOP'92 Symposium proceedings on 4th European symposium on programming
Complete restrictions of the intersection type discipline
Theoretical Computer Science
Strictness analysis using abstract reduction
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Abstract reduction: towards a theory via abstract interpretation
Term graph rewriting
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
Strictness Logic and Polymorphic Invariance
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Polymorphic Typing by Abstract Interpretation
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Fast Abstract Interpretation Using Sequential Algorithms
WSA '93 Proceedings of the Third International Workshop on Static Analysis
Investigating a proof-theoretic meta-language for functional programs
Investigating a proof-theoretic meta-language for functional programs
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
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strictness, totality, and non-standard-type inference
Theoretical Computer Science - Special issue on theories of types and proofs
Algorithms for Equality and Unification in the Presence of Notational Definitions
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Modular control-flow analysis with rank 2 intersection types
Mathematical Structures in Computer Science
A conjunctive type system for useless-code elimination
Mathematical Structures in Computer Science
A syntactic method for finding least fixed points of higher-order functions over finite domains
Journal of Functional Programming
From type checking by recursive descent to type checking with an abstract machine
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
| Hi-index | 0.00 |
The role of non-standard type inference in static program analysis has been much studied recently. Early work emphasised the efficiency of type inference algorithms and paid little attention to the correctness of the inference system. Recently more powerful inference systems have been investigated but the connection with efficient inference algorithms has been obscured. The contribution of this paper is twofold: first we show how to transform a program logic into an algorithm and, second, we introduce the notion of lazy types and show how to derive an efficient algorithm or strictness analysis.