The logic of demand in Haskell

Journal of Functional Programming

Volumn 15, Issue 6, 2005, Pages 837-891

  Harrison, William L ^a   Kieburtz, Richard B ^b  

^a University of Missouri   (United States)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASKELL; HASKELL PROGRAMS; MODEL THEORY; PROGRAM VERIFICATION; PROGRAMMING LOGIC;

FUNCTIONAL PROGRAMMING; SEMANTICS;

PATTERN MATCHING;

EID: 26444539863     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796805005666     Document Type: Article

References (36)

1. Barr, M. and Wells, C. (1990) Category Theory for Computing Science. Prentice Hall.
2. Cheng, J. H. and Jones, C. B. (1991) On the usability of logics which handle partial functions. Proceedings of the Third Refinement Workshop. Springer-Verlag.
3. de Mol, M., van Eekelen, M. and Plasmeijer, R. (2001) Theorem proving for functional programmers. Proceedings of the 13th International Workshop on the Implementation of Functional Programming Languages (IFL'01).
4. Farmer, W. M. (1995) Reasoning about partial functions. Erkenntnis, 43: 279-294.
5. Faxen, K.-F. (2002) A static semantics for haskell. J. Funct. Program. 12(4&5): 295-357.
6. Girard, J.-Y. (1972) Interprétation fonctionnelle et élimination den coupures de l'arithmétique d'ordre supérieur. Thèse d'état, University of Paris VII.
7. Girard, J.-Y. (1989) Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press.
8. Gries, D. and Schneider, F. B. (1995) Avoiding the undefined by underspecification. van Leeuwen, J. (ed.), Computer Science Today: Recent Trends and Developments: Lecture Notes in Computer Science 1000, pp. 366-373. Springer-Verlag.
9. Gumb, R. D. and Lambert, K. (1996) A free logical foundation for nonstrict functions. Proceedings of the CADE-13 Workshop on the Mechanization of Partial Functions, pp. 3946.
10. Gumb, R. D. and Lambert, K. (1997) Definitions in nonstrict positive free logic. Modern Logic, 7: 25-55.
11. Gunter, C. A. (1992) Semantics of Programming Languages: Structures and Techniques. MIT Press.
12. Harper, R. and Mitchell, J. C. (1993) On the type structure of standard ml. ACM Trans. Program. Lang. & Syst. (TOPLAS), 15(2): 211-252.
13. Harrison, W., Sheard, T. and Hook, J. (2002) Fine control of demand in Haskell. 6th International Conference on the Mathematics of Program Construction (MPC 2002): Lecture Noten in Computer Science 2386, pp. 68-93. Springer-Verlag.
14. Hindley, R. J. (1969) The principal type scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146: 29-60.
15. Hudak, P. (2000) The Haskell School of Expression: Learning Functional Programming through Multimedia. Cambridge University Press.
16. Hudak, P., Peterson, J. and Fasel, J. (2000) A Gentle Introduction to Haskell. Haskell language tutorial online at www.haskell.org/tutorial.
17. Huth, M., Jagadeesan, R. and Schmidt, D. (2001) Modal transition systems: A foundation for three-valued program analysis. Proceedings of the European Symposium on Programming (ESOP 2001): Lecture Notes in Computer Science 2028. Springer-Verlag.
18. Jones, M. P. (1999) Typing haskell in haskell. Proceedings of the 1999 Haskell Workshop pp. 68-78. Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht.
19. Konikowska, B., Tarlecki, A. and Blikle, A. (1991) A three-valued logic for software specification and validation. Fundamenta Informaticae, XIV: 411-453.
20. Larsen, K. G. (1990) Modal specifications. Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems: Lecture Notes in Computer Science 407, pp. 232-246. Springer-Verlag.
21. MacQueen, D. B., Plotkin, G. and Sethi, R. (1984) An ideal model for recursive polymorphic types. Information and Control, 71(1/2).
22. Milner, R. (1978) A theory of type polymorphism in programming languages. J. Comput. & Syst. Sci. 17(3): 348-375.
23. Milner, R., Tofte, M., Harper, R. and MacQueen, D. (1997) The Definition of Standard ML (Revised). The MIT Press.
24. Mitchell, J. C. and Harper, R. (1988) The essence of ML. Conference Record of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL 1988), pp. 28-46.
25. Mitchell, J. C. (2000) Foundations for Programming Languages. Third edn. MIT Press.
26. Ohori, A. (1989a) A Simple Semantics for ML Polymorphism. Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture (FPCA), pp. 281-292.
27. Ohori, A. (1989b) A Study of Semantics, Types, and Languages for Databases and Object-oriented Programming. PhD thesis, University of Pennsylvania.
28. Owe, O. (1993) Partial logics reconsidered: A conservative approach. Formal Aspects of Computing, 5(3): 208-223.
29. Peyton Jones, S. (ed). (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press.
30. Plasmeijer, R. and van Eekelen, M. (1999) Functional programming: Keep it CLEAN: A unique approach to functional programming. ACM SIGPLAN Notices, 34(6): 23-31.
31. Reynolds, J. C. (1974) Towards a theory of type structure. Programming Symposium: Lecture Notes in Computer Science 19, pp. 408-425. Springer-Verlag.
32. Schmidt, D. A. (1986) Denotational Semantics: A Methodology for Language Development. Allyn and Bacon.
33. Smyth, M. B. and Plotkin, G. D. (1982) The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4): 761-783.
34. Thompson, S. (1995) A logic for miranda, revisited. Formal Aspects of Computing, 7: 412-429.
35. Thompson, S. (1999) Haskell: The Craft of Functional Programming. Addison-Wesley.
36. Wadler, P. (1992) The essence of functional programming. Conference Record of the 19th Annual ACM Symposium on Principles of Programming Languages (POPL 1992), pp. 1-14.