Refined typechecking with Stardust

PLPV'07: Proceedings of the 2007 Workshop on Programming Languages meets Program Verification

Volumn , Issue , 2007, Pages 21-32

  Dunfield, Jana ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Dependent types; Intersection types; Type refinements; Union types

Indexed keywords

BOOLEAN ALGEBRA; DATA ACQUISITION; FUNCTIONAL PROGRAMMING; INDEXING (OF INFORMATION);

DEPENDENT TYPES; INTERSECTION TYPES;

MARKUP LANGUAGES;

EID: 38849100857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1292597.1292602     Document Type: Conference Paper

References (45)

1. Roberto Amadio and Pierre-Louis Curien. Domains and lambda calculi, volume 46 of Cambridge Tracts in Theoretical Comp. Sci., chapter 3. Cambridge Univ. Press, 1998.
2. Lennart Augustsson. Cayenne - a language with dependent types. In ICFP, pages 239-250, 1998.
3. Adam Bakewell, Sébastien Carlier, A. J. Kfoury, and J. B. Wells. Inferring intersection, typings that are equivalent to call-by-name and call-by-value evaluations. Technical report, Church Project, Boston University, 2005.
4. Clark Barrett and Sergey Berezin. CVC Lite: A new implementation of the Cooperating Validity Checker. In Int'l Conf. Computer Aided Verification (CAV '04), pages 515-518, 2004.
5. Clark W. Barrett, David L. Dill, and Jeremy R. Levitt. Validity checking for combinations of theories with equality. In Int'l Conf. Formal Methods in Computer-Aided Design (FMCAD '96), pages 187-201, 1996.
6. Matthias Blume. No-longer-foreign: Teaching an ML compiler to speak C "natively". Elect. Notes in Theoretical Comp. Sci., 59(1), 2001.
7. Chiyan Chen and Hongwei Xi. Combining programming with theorem proving. In ICFP, pages 66-77, 2005.
8. James Cheney and Ralf Hinze. First-class phantom types. Technical Report CUCIS TR2003-1901, Cornell University, 2003.
9. M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift f. math. Logik und Grundlagen d. Math., 27:45-58, 1981.
10. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990.
11. Rowan Davies. Practical refinement-type checking. PhD thesis, Carnegie Mellon University, 2005. CMU-CS-05-110.
12. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In ICFP, pages 198-208, 2000.
13. Leonardo de Moura, Sam Owre, Harald Rueß, John Rushby, and Natarajan Shankar. The ICS decision procedures for embedded deduction. In Int'l Joint Conf. Automated Reasoning (IJCAR '04), pages 218-222, 2004.
14. Joshua Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, 2007. CMU-CS-07-129. To appear; latest version at http://www.cs.cmu.edu/~joshuad/thesis/.
15. Joshua Dunfield and Frank Pfenning. Type assignment for intersections and unions in call-by-value languages. In Found. Software Science and Computation Structures (FOSSACS '03), pages 250-266, 2003.
16. Joshua Dunfield and Frank Pfenning. Tridirectional typechecking. In POPL, pages 281-292, January 2004.
17. Edward A. Euler, Steven D. Jolly, and H. H. 'Lad' Curtis. The failures of the Mars Climate Orbiter and Mars Polar Lander: a perspective from the people involved. In AAS Guidance and Control Conf., 2001. http://brain.cs.uiuc.edu/ integration/AAS01_MCO_MPL_final.pdf.
18. Sigbjorn Finne, Daan Leijen, Erik Meijer, and Simon Peyton Jones. Calling hell from heaven and heaven from hell. In ICFP, pages 114-125, 1999.
19. Matthew Fluet and Riccardo Pucella. Phantom types and subtyping. ArXiv postprint, http://arxiv.org/abs/cs.PL/0403034. January 2006.
20. Jeffrey Scott Foster. Type qualifiers: lightweight specifications to improve software quality. PhD thesis, University of California, Berkeley, 2002.
21. Tim Freeman, and Frank Pfenning. Refinement types for ML. In PLDI, pages 268-277. ACM Press, 1991.
22. Stefan Kahrs. Red-black trees with types. J. Functional Programming, 11 (4):425-432, 2001.
23. Andrew Kennedy. Programming languages and dimensions. PhD thesis, University of Cambridge, 1996.
24. Daan Leijen and Erik Meijer. Domain specific embedded compilers. In USENIX Conf. Domain-Specific Languages (DSL '99), pages 109-122, 1999.
25. K. Rustan M. Leino. Extended Static Checking: A ten-year perspective. In Dagstuhl Anniversary Conf., pages 157-175, 2001.
26. Daniel R. Licata and Robert Harper. A formulation of Dependent ML with explicit equality proofs. Technical Report CMU-CS-05-178, Carnegie Mellon University, 2005.
27. Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. In ICFP, pages 213-226, 2003.
28. Conor McBride and James McKinna. The view from the left. J. Functional Programming, 14(1):69-111, 2004.
29. Robin Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17(3):348-375, 1978.
30. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
31. Chris Okasaki. Purely Functional Data Structures. Cambridge, 1998.
32. Jens Palsberg and Christina Pavlopoulou. From polyvariant flow information to intersection and union types. J. Functional Programming, 11(3): 263-317, 2001.
33. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Simple unification-based type inference for GADTs. In ICFP, 2006.
34. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991.
35. Benjamin C. Pierce and David N. Turner. Local type inference. In POPL, pages 252-265, 1998. Full version in ACM Trans. Prog. Lang. Sys., 22(1):1-44, 2000.
36. Dag Prawitz. Natural Deduction. Almqvist & Wiksells, 1965.
37. John C. Reynolds. Types, abstraction, and parametric polymorphism. In Information Processing 83, pages 513-523. Elsevier, 1983. http://www.cs.cmu.edu/ afs/cs/user/jcr/ftp/typesabpara.pdf.
38. John. C. Reynolds. Design of the programming language Forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, 1996.
39. Tim Sheard. Languages of the future. SIGPLAN Notices, 39(12):119-132, 2004. OOPSLA '04.
40. Aaron Stump, Clark W. Barrett, and David L. Dill. CVC: A cooperating validity checker. In Int'l Conf. Computer Aided Verification (CAV '02), pages 500-504, 2002.
41. Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. J. Functional Programming, 8(4):367-412, 1998.
42. Hongwei Xi. Applied Type System (extended abstract). In TYPES 2003, LNCS, pages 394-408. Springer, 2004.
43. Hongwei Xi. Dependent types in practical programming. PhD thesis, Carnegie Mellon University, 1998.
44. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In POPL, pages 214-227, 1999.
45. Hongwei Xi, Chiyan Chen, and Gang Chen. Guarded recursive datatype constructors. In POPL, pages 224-235, 2003.