Type reconstruction for general refinement types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4421 LNCS, Issue , 2007, Pages 505-519

  Knowles, Kenneth ^a   Flanagan, Cormac ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS; MODEL CHECKING; SYNTACTICS;

DATA STRUCTURE INVARIANTS; GENERAL-PURPOSE PROGRAMMING LANGUAGE; RECONSTRUCTION ALGORITHMS; SUBSUMES TYPE CHECKING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 37149053876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_34     Document Type: Conference Paper

References (29)

1. A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 31-41, 1993.
2. R. J. R. Back. A calculus of refinements for program derivations. Acta Informática, 25(6):593-624, 1988.
3. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:576-580, 1969.
4. P. Cousot and R. Cousot. Formal language, grammar, and set-constraint-based program analysis by abstract interpretation. In Proceedings of the International Conference on Functional Programming and Computer Architecture, pages 170-181, 1995.
5. R. Davies and F. Pfenning. Intersection types and computational effects. In Proceedings of the A CM International Conference on Functional Programming, pages 198-208, 2000.
6. E. Denney. Refinement types for specification. In Proceedings of the IFIP International Conference on Programming Concepts and Methods, volume 125, pages 148-166. Chapman & Hall, 1998.
7. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
8. J. Dunfield. Combining two forms of type refinements. Technical Report CMUCS-02-182, CMU School of Computer Science, Pittsburgh, Penn., 2002.
9. M. Fähndrich and A. Aiken. Making set-constraint based program analyses scale. Technical Report UCB/CSD-96-917, University of California at Berkeley, 1996.
10. C. Flanagan. Hybrid type checking. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 245 - 256, 2006.
11. C. Flanagan and M. Felleisen. Componential set-based analysis. In Proceedings of the ACM Conference on Programming Language Design and Implementation, pages 235-248, 1997.
12. R. W. Floyd. Assigning meaning to programs. In Proceedings of the Symposium in Applied Mathematics: Mathematical Aspects of Computer Science, pages 19-32, 1967.
13. T. Freeman and F. Pfenning. Refinement types for ML. In Proceedings of the ACM Conference on Programming Language Design and Implementation, pages 268-277, 1991.
14. Y. Fuh and P. Mishra. Type inference with subtypes. In Proceedings of the European Symposium on Programming, pages 155-175, 1988.
15. J. Gronski, K. Knowles, A. Tomb, S. N. Freund, and C. Flanagan. Sage: Practical hybrid checking for expressive types and specifications. In Proceedings of the Workshop on Scheme and Functional Programming, pages 93-104, 2006.
16. S. Hayashi. Logic of refinement types. In Proceedings of the Workshop on Types for Proofs and Programs, pages 157-172, 1993.
17. N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1992.
18. M. Hoang and J. C. Mitchell. Lower bounds on type inference with subtypes. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 176 - 185, 1995.
19. K. Knowles and C. Flanagan. Type reconstruction for general refinement types, http ://www.soe.ucsc.edu/~cormac/papers/htr-full.pdf, 2007.
20. K. R. M. Leino, T. Millstein, and J. B. Saxe. Generating error traces from verification-condition counterexamples. Science of Computer Programming, 55(1-3): 209-226, 2005.
21. P. Lincoln and J. C. Mitchell. Algorithmic aspects of type inference with subtypes. In Proceedings of the A CM Symposium on Principles of Programming Languages, pages 293 - 304, 1992.
22. Y. Mandelbaum, D. Walker, and R. Harper. An effective theory of type refinements. In Proceedings of the A CM International Conference on Functional Programming, pages 213-225, 2003.
23. J. C. Mitchell. Coercion and type inference. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 175 - 185, 1983.
24. A. Nanevski, G. Morrisett, and L. Birkedal. Polymorphism and separation in hoare type theory. In Proceedings of the International Conference on Functional Programming, pages 62-73, 2006.
25. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
26. X. Ou, G. Tan, Y. Mandelbaum, and D. Walker. Dynamic typing with dependent types. In Proceedings of the IFIP International Conference on Theoretical Computer Science, pages 437-450, 2004.
27. B. C. Pierce and D. N. Turner. Local type inference. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 252-265, 1998.
28. F. Pottier. Simplifying subtyping constraints. In Proceedings of the ACM International Conference on Functional Programming, pages 122-133, 1996.
29. H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 214-227, 1999.