Strictness analysis: a new perspective based on type inference
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Intersection and union types: syntax and semantics
Information and Computation
Lazy type inference and program analysis
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Inference of polymorphic and conditional strictness properties
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principality and decidable type inference for finite-rank intersection types
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Gentzen-style sequent calculus of constructions with expansion rules
Theoretical Computer Science
Proving theorems by pattern recognition I
Communications of the ACM
A sequent calculus for subtyping polymorphic types
Information and Computation - Special issue on FLOC '96
Completeness of type assignment systems with intersection, union, and type quantifiers
Theoretical Computer Science - Special issue on theories of types and proofs
Principles of Program Analysis
Principles of Program Analysis
Strictness Analysis in Logical Form
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Higher-Order Chaotic Iteration Sequences
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
| Hi-index | 0.00 |
This paper deals with type-based analysis of functional programs. In particular we focus on strictness analysis using nonstandard type systems using a special kind of type called lazy type. We propose an inequality system for lazy types, from which two algorithms for strictness analysis are extracted. The key idea is elimination of the transitive law from the inequality system. The algorithms have been implemented. We report experimental results on performance of our algorithms.