Extending sized type with collection analysis

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2003, Pages 75-84

  Chin, Wei Ngan ^a   Khoo, Siau Cheng ^a   Xu, Dana N ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Collection Analysis; Fix Point; Mixed Constraints; Polymorphism; Sized Type

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; FUNCTIONS; OPTIMIZATION; SEMANTICS;

PROGRAM ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0038716297     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Wei-Ngan Chin and Siau-Cheng Khoo. Calculating sized types. Higher-Order and Symbolic Computation. 14(2-3):261-300, 2001.
2. W.N. Chin and S.C. Khoo. Calculating sized types. In 2000 ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 62-72, Boston, Massachusetts, United States, January 2000.
3. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Symposium on Principles of Programming Languages, pages 84-96. ACM Press, 1978.
4. D Dussart, F Henglein, and C Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Static Analysis Symposium, (LNCS, vol 983, pp. 118-135) Springer-Verlag, 1995.
5. M. Fahndrich and J Rehof. Type-based flow analysis: From polymorphic subtyping to cfl reachability. In ACM Conference on Principles of Programming Languages, 2001.
6. Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, and Harald Sondergaard. Boolean constraints for binding-time analysis. In Programs as Data Objects (PADO II), pages 39-62, Aarhus, Denmark, May 2001.
7. J Gustavsson and J Svenningsson. Constraint abstractions. In Programs as Data Objects (PADO II), pages 63-83, Aarhus, Denmark, May 2001.
8. N. Halbwachs. About synchronous programming and abstract interpretation. Science of Computer Programming, Special Issue on SAS'94, 31(1), May 1998.
9. N. Halbwachs, Y.E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, 1997.
10. L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras: Part I. North-Holland, 1971.
11. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In 23rd ACM Principles of Programming Languages Conference, pages 410-423. ACM Press, January 1996.
12. N Kobayashi. Type-based useless variable elimination. In 2000 PEPM, pages 84-93, 2000.
13. Daniel Le Metayer. Proving properties of programs defined over recursive data structure. In ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-99, La Jolla, California, June 1995. ACM Press.
14. S. Nishimura. Parametric polymorphic type inference in constraint form. In Second JSSST Workshop on Programming and Programming Languages, pages 38-49, March 2000.
15. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
16. W. Pugh. The Omega Test: A fast practical integer programming algorithm for dependence analysis. Communications of ACM, 8:102-114, 1992.
17. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In 4th ACM Conference on Functional programming Languages and Computer Architecture, pages 1-11, California, June 1995. ACM Press.
18. K Wansbrough and S. L. Peyton Jones. Once upon a polymorphic type. In ACM Conference on Principles of Programming Languages, pages 15-28, 1999.
19. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In ACM Conference on Programming Language Design and Implementation, pages 249-257. ACM Press, June 1998.
20. H. Xi and F. Pfenning. Dependent types in practical programming. In Symposium on Principles of Programming Languages, pages 214-227. ACM Press, January 1999.