Refinement types for Haskell

ACM SIGPLAN Notices

Volumn 49, Issue 9, 2014, Pages 269-282

  Vazou, Niki ^a   Seidel, Eric L ^a   Jhala, Ranjit ^a   Vytiniotis, Dimitrios ^b   Peyton Jones, Simon ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINDERS; BINS;

EXPERIMENTAL EVALUATION; FREE VARIABLE; HASKELL; LAZY EVALUATION; LINES OF CODE; TYPE SYSTEMS; VERIFICATION CONDITION;

RECURSIVE FUNCTIONS;

EID: 84950145876     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2628136.2628161     Document Type: Conference Paper

References (38)

1. L. Augustsson. Cayenne-a language with dependent types. In ICFP, 1998.
2. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Typebased termination of recursive definitions. Mathematical Structures in Computer Science, 2004.
3. J. F. Belo, M. Greenberg, A. Igarashi, and B. C. Pierce. Polymorphic contracts. In ESOP, 2011.
4. J. Bengtson, K. Bhargavan, C. Fournet, A. D. Gordon, and S. Maffeis. Refinement types for secure implementations. ACM TOPLAS, 2011.
5. Y. Bertot and P. Castéran. Coq'Art: The Calculus of Inductive Constructions. Springer Verlag, 2004.
6. A. Bradley and Z. Manna. The Calculus of Computation: Decision Procedures With Application To Verification. Springer-Verlag, 2007.
7. E. Brady. Idris: general purpose programming with dependent types. In PLPV, 2013.
8. V. Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 2005.
9. C. Casinghino, V. Sjöberg, and S. Weirich. Combining proofs and programs in a dependently typed language. In POPL, 2014.
10. R. L. Constable and S. F. Smith. Partial objects in constructive type theory. In LICS, 1987.
11. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. 2008.
12. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 2005.
13. J. Dunfield. Refined typechecking with Stardust. In PLPV, 2007.
14. C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In PLDI, 2002.
15. J. Giesl, M. Raffelsieper, P. Schneider-Kamp, S. Swiderski, and R. Thiemann. Automated termination proofs for Haskell by term rewriting. TPLS, 2011.
16. C. A. R. Hoare. Procedures and parameters: An axiomatic approach. In Symposium on Semantics of Algorithmic Languages. 1971.
17. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In POPL, 1996.
18. L. Jia, J. A. Vaughan, K. Mazurak, J. Zhao, L. Zarko, J. Schorr, and S. Zdancewic. Aura: a programming language for authorization and audit. In ICFP, 2008.
19. N. D. Jones and N. Bohr. Termination analysis of the untyped lambacalculus. In RTA, 2004.
20. M. Kawaguchi, P. Rondon, and R. Jhala. Type-based data structure verification. In PLDI, 2009.
21. K.W. Knowles and C. Flanagan. Hybrid type checking. ACM TOPLAS, 2010.
22. G. Nelson. Techniques for program verification. Technical Report CSL81-10, Xerox Palo Alto Research Center, 1981.
23. T. Nipkow. Hoare logics for recursive procedures and unbounded nondeterminism. In CSL, 2002.
24. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers, 2007.
25. S. R. Della Rocca and L. Paolini. The Parametric Lambda Calculus, A Metamodel for Computation. 2004.
26. P. Rondon, M. Kawaguchi, and R. Jhala. Liquid Types. In PLDI, 2008.
27. J. Rushby, S. Owre, and N. Shankar. Subtypes for specifications: Predicate subtyping in pvs. IEEE TSE, 1998.
28. D. Sereni and N.D. Jones. Termination analysis of higher-order functional programs. In APLAS, 2005.
29. W. Sonnex, S. Drossopoulou, and S. Eisenbach. Zeno: An automated prover for properties of recursive data structures. In TACAS, 2012.
30. M. Sulzmann, M. M. T. Chakravarty, S. L. Peyton-Jones, and K. Donnelly. System F with type equality coercions. In TLDI, 2007.
31. N. Swamy, J. Chen, C. Fournet, P-Y. Strub, K. Bhargavan, and J. Yang. Secure distributed programming with value-dependent types. In ICFP, 2011.
32. A. M. Turing. On computable numbers, with an application to the eintscheidungsproblem. In LMS, 1936.
33. N. Vazou, P. Rondon, and R. Jhala. Abstract refinement types. In ESOP, 2013.
34. N. Vazou, E. L. Seidel, and R. Jhala. Liquidhaskell: Experience with refinement types in the real world. In Haskell Symposium, 2014.
35. D. Vytiniotis, S.L. Peyton-Jones, K. Claessen, and D. Rosén. Halo: haskell to logic through denotational semantics. In POPL, 2013.
36. H. Xi. Dependent types for program termination verification. In LICS, 2001.
37. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In PLDI, 1998.
38. D. N. Xu, S. L. Peyton-Jones, and K. Claessen. Static contract checking for haskell. In POPL, 2009.