What is a purely functional language?

Journal of Functional Programming

Volumn 8, Issue 1, 1998, Pages 1-22

  Sabry, Amr ^a,b  

^a UNIVERSITY OF OREGON   (United States)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032391006     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796897002943     Document Type: Article

References (32)

1. Ariola, Z. M. and Felleisen, M. (1997) The call-by-need lambda calculus. J. Functional Programming. 7(3).
2. Ariola, Z. M., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995) A call-by-need lambda calculus. ACM Symposium on Principles of Programming Languages, pp. 233-246.
3. Barendregt, H. P. (1984) The Lambda Calculus: Its syntax and semantics. (Revised edn.) Studies in Logic and the Foundations of Mathematics, Vol. 103. North-Holland.
4. Cartwright, R. and Felleisen, M. (1991) Observable sequentiality and full abstraction. Technical report 91-167, Rice University. (Preliminary version in Proc. 19th ACM Symposium on Principles of Programming Languages (1992), pp. 328-342.)
5. Cartwright, R. and Felleisen, M. (1991) Observable sequentiality and full abstraction. Technical report 91-167, Rice University. (Preliminary version in Proc. 19th ACM Symposium on Principles of Programming Languages (1992), pp. 328-342.)
6. Cartwright, R., Curien, P.-L. and Felleisen, M. (1993) Fully abstract semantics for observably sequential languages. Technical report 93-219, Rice University. (Also appears in Information and Computation, 111(2): 1994, 297-401.)
7. Cartwright, R., Curien, P.-L. and Felleisen, M. (1993) Fully abstract semantics for observably sequential languages. Technical report 93-219, Rice University. (Also appears in Information and Computation, 111(2): 1994, 297-401.)
8. Felleisen, M. (1991) On the expressive power of programming languages. Science of Computer Programming, Vol. 17, pp. 35-75 (Preliminary version in Proc. European Symposium on Programming: Lecture Notes in Computer Science 432, pp. 134-151. Springer-Verlag (1990).)
9. Felleisen, M. (1991) On the expressive power of programming languages. Science of Computer Programming, Vol. 17, pp. 35-75 (Preliminary version in Proc. European Symposium on Programming: Lecture Notes in Computer Science 432, pp. 134-151. Springer-Verlag (1990).)
10. Felleisen, M. and Hieb, R. (1992) The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 102: 235-271.
11. Filinski, A. (1994) Representing monads. ACM Symposium on Principles of Programming Languages, pp. 446-457.
12. Filinski, A. (1996) Controlling effects. PhD thesis, Carnegie Mellon University. (Available as Technical Report CS-96-119.)
13. Hudak, P., Peyton Jones, S. L. and Wadler, P. (1992) Report on the programming language Haskell, a non-strict purely functional language (version 1.2). SIGPLAN Notices, 27(5).
14. Klop, J. W., van Oostrom, V. and van Raamsdon, F. (1993) Combinatory reduction systems: Introduction and survey. Technical report IR-327, Vrije Universiteit Amsterdam.
15. Launchbury, J. and Peyton Jones, S. L. (1995) State in Haskell. Lisp and Symbolic Computation, 8: 193-341.
16. Launchbury, J, and Sabry, A. (1997) Monadic state: Axiomatization and type safety. ACM SIGPLAN International Conference on Functional Programming, pp. 227-238.
17. Odersky, M., Rabin, D. and Hudak, P. (1993) Call by name, assignment, and the lambda calculus. ACM Symposium on Principles of Programming Languages, pp. 43-56.
18. O'Hearn, P. W. (1996) Note on Algol and conservatively extending functional programming. J. Functional Programming. 6(1): 171-180.
19. Peterson, J. et al. . (1996) Report on the programming language Haskell (version 1.3). Technical report YALEU/DCS/RR-1106, Yale University.
20. Peyton Jones, S. L. and Wadler, P. (1993) Imperative functional programming. ACM Symposium on Principles of Programming Languages, pp. 71-84.
21. Plotkin, G. D. (1975) Call-by-name, call-by-value, and the λ-calculus. Theoretical Computer Science, 1: 125-159.
22. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science, 5: 223-255.
23. Reynolds, J. C. (1972) Definitional interpreters for higher-order programming languages. Proceedings of the ACM Annual Conference, pp. 717-740.
24. Reynolds, J. C. (1981) The essence of Algol. In: de Bakker and van Vliet (eds.), Algorithmic Languages, pp. 345-372. North-Holland.
25. Reynolds, J. C. (1988) Preliminary design of the programming language Forsythe. Technical report CMU-CS-88-159, Carnegie Mellon University.
26. Reynolds, J. C. (1991) Replacing complexity with generality: The programming language Forsythe. Carnegie Mellon University. (Unpublished manuscript.)
27. Sabry, A. and Field, J. (1993) Reasoning about explicit and implicit representations of state. Technical report YALEU/DCS/RR-968, Yale University. (ACM SIGPLAN Workshop on State in Programming Languages, pp. 17-30.)
28. Sabry, A. and Field, J. (1993) Reasoning about explicit and implicit representations of state. Technical report YALEU/DCS/RR-968, Yale University. (ACM SIGPLAN Workshop on State in Programming Languages, pp. 17-30.)
29. Sondergaard, H. and Sestoft, P. (1990) Referential transparency, definiteness and unfoldability. Acta Informatica, 27(6): 505-517.
30. Swamp, V., Reddy, U. and Ireland, E. (1991) Assignments for applicative languages. Conference on Functional Programming and Computer Architecture, pp. 192-214.
31. Wadler, P. (1990) Comprehending monads. ACM Conference on Lisp and Functional Programming, pp. 61-78.
32. Weeks, S. and Felleisen, M. (1993) On the orthogonality of assignments and procedures in Algol. ACM Symposium on Principles of Programming Languages, pp. 57-70.