Polymorphic contracts

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

Volumn 6602 LNCS, Issue , 2011, Pages 18-37

  Belo, João Filipe ^a   Greenberg, Michael ^a   Igarashi, Atsushi ^b   Pierce, Benjamin C ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

abstract datatypes; contracts; dynamic checking; logical relations; parametric polymorphism; postconditions; preconditions; refinement types; subtyping; syntactic proof

Indexed keywords

ABSTRACT DATA TYPES; DYNAMIC CHECKING; LOGICAL RELATIONS; PARAMETRIC POLYMORPHISM; POSTCONDITIONS; PRECONDITIONS; REFINEMENT TYPES; SUBTYPINGS;

REFINING; SYNTACTICS;

ABSTRACTING;

EID: 79953214103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19718-5_2     Document Type: Conference Paper

References (19)

1. PLT Racket Contracts, http://pre.plt-scheme.org/docs/html/guide/ contracts.html
2. Ahmed, A., Findler, R.B., Matthews, J., Wadler, P.: Blame for all. In: Workshop on Script-to-Program Evolution, STOP (2009)
3. Ahmed, A., Findler, R.B., Siek, J., Wadler, P.: Blame for all. In: Principles of Programming Languages, POPL (2011)
4. Aspinall, D., Compagnoni, A.: Subtyping dependent types. Theor. Comput. Sci. 266(1-2), 273-309 (2001)
5. Findler, R.B., Felleisen, M.: Contracts for higher-order functions. In: International Conference on Functional Programming (ICFP), pp. 48-59 (2002)
6. Flanagan, C.: Hybrid type checking. In: POPL, pp. 245-256 (2006)
7. Greenberg, M., Pierce, B.C., Weirich, S.: Contracts made manifest. In: Principles of Programming Languages, POPL 2010 (2010)
8. Gronski, J., Flanagan, C.: Unifying hybrid types and contracts. In: Trends in Functional Programming, TFP (2007)
9. Guha, A., Matthews, J., Findler, R.B., Krishnamurthi, S.: Relationally-parametric polymorphic contracts. In: DLS, pp. 29-40 (2007)
10. Knowles, K., Flanagan, C.: Hybrid type checking (2010) (to appear in TOPLAS)
11. Matthews, J., Ahmed, A.: Parametric polymorphism through run-time sealing or, theorems for low, low prices! In: Gairing, M. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 16-31. Springer, Heidelberg (2008)
12. Ou, X., Tan, G., Mandelbaum, Y., Walker, D.: Dynamic typing with dependent types. In: IFIP TCS, pp. 437-450 (2004)
13. Pierce, B., Sumii, E.: Relating cryptography and polymorphism (July 2000)
14. Pitts, A.M.: Typed operational reasoning. In: Pierce, B.C. (ed.) Advanced Topics in Types and Programming Languages, ch. 7, pp. 245-289. MIT Press, Cambridge (2005)
15. Siek, J.G., Taha, W.: Gradual typing for functional languages. In: Scheme and Functional Programming Workshop (September 2006)
16. Strickland, T.S., Tobin-Hochstadt, S., Felleisen, M.: Practical variable-arity polymorphism. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 32-46. Springer, Heidelberg (2009)
17. Wadler, P.: Theorems for free! In: Proceedings of ACM Conference on Functional Programming and Computer Architecture (FPCA 1989), pp. 347-359, London, UK (September 1989)
18. Wadler, P., Findler, R.B.: Well-typed programs can't be blamed. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 1-16. Springer, Heidelberg (2009)
19. Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Information and Computation 115, 38-94 (1992)