Typed contracts for functional programming

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

Volumn 3945 LNCS, Issue , 2006, Pages 208-225

  Hinze, Ralf ^a   Jeuring, Johan ^b   Löh, Andres ^a  

^a UNIVERSITY OF BONN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DATA REDUCTION; EMBEDDED SYSTEMS; FUNCTIONS; ROBUSTNESS (CONTROL SYSTEMS);

DATA TYPES; DOMAIN-SPECIFIC LANGUAGES; FUNCTIONAL PROGRAMMING; ROBUST SOFTWARE;

MATHEMATICAL PROGRAMMING;

EID: 33745822726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11737414_15     Document Type: Conference Paper

References (18)

1. Meyer, B.: Applying 'design by contract'. IEEE Computer 25(10) (1992) 40-51
2. Meyer, B.: Eiffel: The Language. Prentice Hall (1992)
3. Findler, R.B., Felleisen, M.: Contracts for higher-order functions. ACM SIGPLAN Notices 37(9) (2002) 48-59
4. Peyton Jones, S.: Haskell 98 Language and Libraries. Cambridge University Press (2003)
5. The GHC Team: The Glorious Glasgow Haskell Compilation System User's Guide, Version 6.4.1. (2005) Available from http://www.haskell.org/ghc/.
6. Blume, M., McAllester, D.: A sound (and complete) model of contracts. ACM SIGPLAN Notices 39(9) (2004) 189-200
7. Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: POPL '03, ACM Press (2003) 224-235
8. Hinze, R.: Fun with phantom types. In Gibbons, J., de Moor, O., eds.: The Fun of Programming. Palgrave Macmillan (2003) 245-262 ISBN 1-4039-0772-2 hardback, ISBN 0-333-99285-7 paperback.
9. Peyton Jones, S., Washburn, G., Weirich, S.: Wobbly types: Type inference for generalised algebraic data types. Technical Report MS-CIS-05-26, University of Pennsylvania (2005)
10. Hinze, R.: Polytypic values possess polykinded types. Science of Computer Programming 43 (2002) 129-159
11. Hutton, G.: A tutorial on the universality and expressiveness of fold. Journal of Functional Programming 9(4) (1999) 355-372
12. Wadler, P.: Theorems for free! In: The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, UK, Addison-Wesley Publishing Company (1989) 347-359
13. Findler, R.B.: Behavioral software contracts (dissertation). Technical Report TR02-402, Department of Computer Science, Rice University (2002)
14. Blume, M., McAllester, D.: Sound and complete models of contracts. Journal of Functional Programming (2006) to appear.
15. Findler, R.B., Blume, M., Felleisen, M.: An investigation of contracts as projections. Technical Report TR-2004-02, The University of Chicago (2004)
16. Nordström, B., Petersson, K., Smith, J.: Programming in Martin-Löf's Type Theory. Oxford University Press (1990)
17. Claessen, K., Runciman, C., Chitil, O., Hughes, J., Wallace, M.: Testing and tracing lazy functional programs using Quickcheck and Hat. In Jeuring, J., Peyton Jones, S., eds.: Advanced Functional programming. Volume 2638 of Lecture Notes in Computer Science., Springer-Verlag (2003)
18. Chitil, O., McNeill, D., Runciman, C.: Lazy assertions. In Trinder, P., Michaelson, G., Peña, R., eds.: Implementation of Functional Languages: 15th International Workshop, IFL 2003, Edinburgh, UK, September 8-11, 2003. Volume 3145 of Lecture Notes in Computer Science., Springer-Verlag (2004) 1-19