An Effective Theory of Type Refinements

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 8, Issue , 2003, Pages 213-225

  Mandelbaum, Yitzhak ^a   Walker, David ^a   Harper, Robert ^b  

^a PRINCETON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Effectful Computation; Linear Logic; Local Reasoning; Type Refinement; Type Theory

Indexed keywords

COMPUTATION THEORY; ENCODING (SYMBOLS); LOGIC DESIGN; OPTIMIZATION; PROGRAM DEBUGGING; SEMANTICS; SUBROUTINES; SYNTACTICS;

EFFECTFUL COMPUTATION; LINEAR LOGIC; LOGICAL REASONING; TYPE REFINEMENT; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1142263318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944725     Document Type: Conference Paper

References (39)

1. Simon Ambler. First-order Linear Logic in Symmetric Monoidal Closed Categories. PhD thesis, University of Edinburgh, 1991.
2. Leonart Augustsson. Cayenne - a language with dependent types. In ACM International Conference on Functional Programming, pages 239-250, Baltimore, September 1999. ACM Press.
3. Iliano Cervesato, Joshua S. Hodas, and Frank Pfenning. Efficient resource management for linear logic proof search. In Proceedings of the Fifth International Workshop on Extensions of Logic Programming - ELP'96, pages 67-81, Leipzig, Germany, March 1996.
4. Karl Crary and Joe Vanderwaart. An expressive, scalable type theory for certified code. In ACM International Conference on Functional Programming, Pittsburgh, October 2002. ACM Press.
5. Karl Crary and Stephanie Weirich. Flexible type analysis. In ACM International Conference on Functional Programming, pages 233-248, Paris, September 1999.
6. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In ACM International Conference on Functional Programming, pages 198-208, Montreal, September 2000. ACM Press.
7. Rob Deline and Manuel Fähndrich. Enforcing high-level protocols in low-level software. In ACM Conference on Programming Language Design and Implementation, pages 59-69, Snowbird, Utah, June 2003. ACM Press.
8. Ewen Denney. A Theory of Program Refinement, PhD thesis, University of Edinburgh, Edinburgh, 1998.
9. David L. Detlefs. An overview of the extended static checking system. In The First Workshop on Formal Methods in Software Practice, pages 1-9. ACM(SIGSOFT), January 1996.
10. Manuel Fähndrich and Rob Deline. Adoption and focus: Practical linear types for imperative programming. In ACM Conference on Programming Language Design and Implementation, pages 13-24, Berlin, June 2002. ACM Press.
11. Cormac Flanagan and Martin Abadi. Types for safe locking. In S.D. Swierstra, editor, Lecture Notes in Computer Science, volume 1576, pages 91-108, Amsterdam, March 1999. Springer-Verlag. Appeared in the Eighth European Symposium on Programming.
12. Cormac Flanagan, Rustan Leino, Mark Lillibridge, Greg Nelsonand James Saxes, and Raymie Stata. Extended static checking for java. In ACM Conference on Programming Language Design and Implementation, Berlin, June 2002. ACM Press.
13. Jeffrey Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualifiers. In ACM Conference on Programming Language Design and Implementation, Berlin, June 2002. ACM Press,
14. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
15. Andrew Gordon and Alan Jeffrey. Typing correspondence assertions for communication protocols. In Mathematical Foundations of Programming Semantics 17. Elsevier, 2001.
16. Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. Region-based memory management in cyclone. In ACM Conference on Programming Language Design and Implementation, Berlin, June 2002. ACM Press.
17. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In ACM Symposium on Principles of Programming Languages, pages 331-342, Portland, Oregon, January 2002. ACM Press.
18. Samin Ishtiaq and Peter O'Hearn. BI as an assertion language for mutable data structures, In Twenty-Eighth ACM Symposium on Principles of Programming Languages, pages 14-26, London, UK, January 2001.
19. Patrick Lincoln and Andre Scedrov. First-order linear logic without modalities is NEXPTIME-hard. Theoretical Computer Science, 135:139-154, 1994.
20. Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. Technical Report TR-656-02, Princeton University, December 2002.
21. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
22. George Necula. Proof-carrying code. In Twenty-Fourth ACM Symposium on Principles of Programming Languages, pages 106-119, Paris, 1997.
23. George Necula and Peter Lee. Safe kernel extensions without run-time checking. In Proceedings of Operating System Design and Implementation, pages 229-243, Seattle, October 1996.
24. George C. Necula, Scott McPeak, and Westley Weimer. Ccured: Type-safe retrofitting of legacy code. In ACM Symposium on Principles of Programming Languages, London, January 2002. ACM Press.
25. Nathaniel Nystrom, Michael Clarkson, and Andrew C. Myers. Polyglot: An extensible compiler framework for Java. In 12th International Conference on Compiler Construction, April 2003. to appear.
26. Peter O'Hearn and David Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999.
27. Peter O'Hearn, John C. Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In CSL '01, pages 1-19, Paris, 2001.
28. Frank Pfenning. Structural cut elimination in linear logic. Technical Report CMU-CS-94-222, Department of Computer Science, Carnegie Mellon University, December 1994.
29. Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11(4):511-540, 2001.
30. Frank Pfenning and Carsten Schürmann. system description: Twelf - a metalogical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, number 1632 in LNAI, pages 202-206, Trento, Italy, July 1999. Springer-Verlag.
31. John C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial perspectives in computer science, Palgrove, 2000.
32. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Symposium on Logic in Computer Science'02, pages 55-74, 2002.
33. Zhong Shao, Bratin Saha, Valery Trifonov, and Nikolaos Papaspyrou. A type system for certified binaries. In ACM Symposium on Principles of Programming Languages, London, January 2002. ACM Press.
34. Frederick Smith, David Walker, and Greg Morrisett. Alias types. In European Symposium on Programming, pages 366-381, Berlin, March 2000.
35. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
36. David Walker, Karl Crary, and Greg Morrisett. Typed memory management in a calculus of capabilities. ACM Transactions on Programming Languages and Systems, 22(4):701-771, May 2000.
37. David Walker and Greg Morrisett. Alias types for recursive data structures. In Workshop on Types in Compilation, Montreal, September 2000.
38. Hongwei Xi and Frank Pfenning. Eliminating array bound checking through dependent types. In ACM Conference on Programming Language Design and Implementation, pages 249-257, Montreal, June 1998.
39. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In Twenty-Sixth ACM Symposium on Principles of Programming Languages, pages 214-227, San Antonio, TX, January 1999.