Contracts made manifest

Journal of Functional Programming

Volumn 22, Issue 3, 2012, Pages 225-274

  Greenberg, Michael ^a   Pierce, Benjamin C ^a   Weirich, Stephanie ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863302585     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796812000135     Document Type: Article

References (25)

1. Ahmed, A. (2006) Step-indexed syntactic logical relations for recursive and quantified types. In Proceedings of theEuropean Symposium on Programming (ESOP), Lecture Notes in Computer Science, vol. 3924. Berlin, Germany: Springer-Verlag, pp. 69-83. (Pubitemid 44019552)
2. Aydemir, B. & Weirich, S. (June 2010) LNgen: Tool support for locally nameless representations. Tech. Report MS-CIS-10-24. Department of Computer and Information Science, University of Pennsylvania.
3. Belo, J. F., Greenberg, M., Igarashi, A. & Pierce, B. C. (2011) Polymorphic contracts. In Proceedings of the European Symposium on Programming (ESOP), Saarbrücken, Germany, pp. 18-37.
4. Blume, M. & McAllester, D. A. (2006) Sound and complete models of contracts. J. Funct. Program. (JFP) 16, 375-414. (Pubitemid 44229842)
5. Cardelli, L., Martini, S., Mitchell, J. C. & Scedrov, A. (1994) An extension of system F with sub-typing. Inf. Comput. 9, 4-56.
6. Chitil, O. & Huch, F. (2007) Monadic, prompt lazy assertions in Haskell. In Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS), LNCS vol. 4807. New York, NY: Springer, pp. 38-53.
7. Dimoulas, C., Findler, R. B., Flanagan, C. & Felleisen, M. (2011) Correct blame for contracts: No more scapegoating. In Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Austin, TX, USA, pp. 215-226.
8. Findler, R. B. & Blume, M. (2006) Contracts as pairs of projections. In Proceedings of the Functional and Logic Programming (FLOPS), Fuji Susono, Japan, LNCS vol. 3945, pp. 226-241. (Pubitemid 44029270)
9. Findler, R. B. & Felleisen, M. (2002) Contracts for higher-order functions. In Proceedings of the Seventh ACM SIGPLAN International Conference on International Conference on Functional Programming (ICFP), Pittsburgh, PA, USA, pp. 48-59.
10. Flanagan, C. (2006) Hybrid type checking. In Proceedings of the 33rd ACM SIGPLANSIGACT Symposium on the Principles of Programming Languages (POPL), Charleston, SC, USA, pp. 245-256.
11. Greenberg, M., Pierce, B. C. & Weirich, S. (2010) Contracts made manifest. In Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages (POPL), Madrid, Spain, pp. 353-364.
12. Gronski, J. & Flanagan, C. (2007). Unifying hybrid types and contracts. In Proceedings of the 8th Symposium on Trends in Functional Programming (TFP), New York, NY, USA, pp. 54-70.
13. Guha, A., Matthews, J., Findler, R. B. & Krishnamurthi, S. (2007) Relationally-parametric polymorphic contracts. In Proceedings of the Dynamic Languages Symposium (DLS), Montreal, Quebec, Canada, October 22, pp. 29-40. (Pubitemid 351429528)
14. Hinze, R., Jeuring, J. & Löh, A. (2006) Typed contracts for functional programming. In Proceedings of the Functional and Logic Programming (FLOPS), Fuji Susono, Japan, LNCS vol. 3945, pp. 208-225. (Pubitemid 44029269)
15. Knowles, K. & Flanagan, C. (January 2010) Hybrid type checking. ACM Trans. Program. Lang. Syst. (TOPLAS) 32 (2), Article 6, 34 pp.
16. Knowles, K., Tomb, A., Gronski, J., Freund, S. N. & Flanagan, C. (2006) Sage: Hybrid checking for flexible specifications. In Proceedings of the Scheme and Functional Programming Workshop, University of Chicago, pp. 93-104.
17. Meyer, B. (1992) Eiffel: The Language. Upper Saddle River, NJ: Prentice-Hall.
18. Ou, X., Tan, G., Mandelbaum, Y. & Walker, D. (2004) Dynamic typing with dependent types. In Proceedings of the IFIP Conference on Theoretical Computer Science (TCS), Toulouse, France, pp. 437-450.
19. Pitts, A. M. (2005) Typed operational reasoning. In Advanced Topics in Types and Programming Languages, Chap. 7. Pierce, B. C. (ed). Cambridge, MA: MIT Press, pp. 245-289.
20. Sewell, P., Nardelli, F. Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S. & Strnisa, R. (2007) Ott: Effective tool support for the working semanticist. In Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP), Freiburg, Germany, October 1-3, pp. 1-12. (Pubitemid 351203740)
21. Tobin-Hochstadt, S. & Felleisen, M. (2008) The design and implementation of typed scheme. In Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), San Francisco, USA, pp. 395-406.
22. Wadler, P. & Findler, R. B. (2007) Well-typed programs can't be blamed. Proceedings of the Scheme and Functional Programming Workshop, Freiburg, Germany, September 30.
23. Wadler, P. & Findler, R. B. (2009) Well-typed programs can't be blamed. In Proceedings of the 18th European Symposium on Programming (ESOP), York, UK, March 25-27, pp. 1-16.
24. Wright, A. K. & Felleisen, M. (1994) A syntactic approach to type soundness. Inf. Comput. 115, 38-94.
25. Xu, D. N., Peyton Jones, S. & Claessen, K. (2009) Static contract checking for Haskell. In Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages (POPL), Savannah, Georgia, January 21-23, pp. 41-52.