Sound and complete models of contracts

Journal of Functional Programming

Volumn 16, Issue 4-5, 2006, Pages 375-414

  Blume, Matthias ^a   McAllester, David ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWER; HIGHER-ORDER; SOUND AND COMPLETE; SOUNDNESS AND COMPLETENESS;

ALGORITHMS;

SEMANTICS;

EID: 33745867351     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796806005971     Document Type: Conference Paper

References (19)

1. Appel, Andrew W., & McAllester, David. (2001). An indexed model of recursive types for foundational proof-carrying code. ACM Trans. on Programming Languages and Systems, 23(5), 657-683.
2. Blume, Matthias, & McAllester, David. (2004). A sound (and complete) model of contracts. Pages 189-200 of: Proc. 2004 ACM SIGPLAN International Conference on Functional Programming (ICFP'04). ACM Press.
3. Bruce, Kim B., Cardelli, Luca, & Pierce, Benjamin C. (1997). Comparing object encodings. Pages 415-438 of: Theoretical aspects of computer software.
4. Brus, T.H., van Eekelen, M.C., van Leer, M.O., & Plasmeijer, M.J. (1987). CLEAN: A Language for Functional Graph Rewriting. Kahn, G. (ed), Proc. of the Conf. on Functional Programming Languages and Computer Architecture (FPCA'87), Portland, Oregon, USA. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, Germany.
5. Dijkstra, Edsger W. (1976). A discipline of programming. Prentice-Hall.
6. Felleisen, Matthias, & Hieb, Robert. (1992). A revised report on the syntactic theories of sequential control and state. Theoretical computer science, 103(2), 235-271.
7. Felleisen, Matthias, Findler, Robert Bruce, Flatt, Matthew, & Kristnamurthi, Shriram. (1998). The DrScheme project: An overview. SIGPLAN Notices, 33(6), 17-23.
8. Findler, Robert B. (2002). Behavioral software contracts. Ph.D. thesis, Rice University.
9. Findler, Robert Bruce, & Felleisen, Matthias. (2002). Contracts for higher-order functions. Pages 48-59 of: Proc. of the 7th ACM SIGPLAN International Conference on Functional Programming. ACM Press.
10. Findler, Robert Bruce, Clements, John, Cormac Flanagan, Matthew Flatt, Krishnamurthi, Shriram, Steckler, Paul, & Felleisen, Matthias. (2002). DrScheme: A programming environment for Scheme. Journal of Functional Programming, 12(2), 159-182.
11. Findler, Robert Bruce, Blume, Matthias, & Felleisen, Matthias. (2004). An investigation of contracts as projections. Tech. rept. TR-2004-02. University of Chicago Computer Science Department.
12. Hartley Rogers, Jr. (1987). Theory of recursive functions and effective computability. Cambridge, MA, USA: MIT Press.
13. Hoare, C A. R. (1969). An axiomatic basis for computer programming. Communications of the acm, 12(10), 578-580.
14. Jones, Simon Peyton. (2003). Haskell 98 language and libraries. Cambridge University Press.
15. Leroy, Xavier. 1990 (Feb.). The ZINC experiment: an economical implementation of the ML language. Tech. rept. No. 117. INRIA.
16. Meyer, Bertrand. (1992). Eiffel: The Language. Prentice-Hall.
17. Milner, Robin, Tofte, Mads, Harper, Robert, & MacQueen, David. (1997). The definition of Standard ML (revised). Cambridge, MA: MIT Press.
18. Rice, H. G. (1953). Classes of recursively enumerable sets and their decision problems. Trans. amer. math, soc., 74, 358-366.
19. Scott, D. S. (1972). Continuous lattices. Pages 97-136 of: Lawvere, F. W. (ed), Topases, algebraic geometry and logic. Lecture Notes in Mathematics, vol. 274. Springer.