On the Productivity of Recursive List Definitions

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 11, Issue 4, 1989, Pages 633-649

  Sijtsma, Ben A ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING;

FUNCTIONAL LANGUAGES; LAZY EVALUATION; RECURSIVE LIST DEFINITIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0024751480     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/69558.69563     Document Type: Article

References (17)

1. Abelson, H., and Sussman, G. J. Structure and Interpretation of Computer Programs. McGraw-Hill, New York, 1985.
2. Cartwright, R., and Donahue, J. The semantics cf Lazy (and industrious) evaluation. In Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming (Pittsburgh, Pa., 1982). ACM, New York, 1982, pp. 253–264.
3. Dijkstra, E. W. Hammings's exercise in SASL. Personal note EWD 792, University of Texas at Austin, 1981.
4. Dijkstra, E. W. On the productivity of recursive definitions. Personal note EWD 749, University of Texas at Austin, 1980.
5. Gries, D. The Science of Programming. Springer-Verlag, New York, 1981.
6. Hankin, C. L., Burn, G., and Peyton Jones, S. L. A safe approach to parallel combinator reduction (extended abstract). ESOP 86 (LNCS 213), B. Robinet, and R. Wilhelm, Eds. Springer-Verlag, New York, 1986, pp. 99–110.
7. Hoare, C. A. R. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, N. J., 1985.
8. Hoogerwoord, R. R. Technical University Eindhoven, The Netherlands, private communication, 1986.
9. Kahn, G., and MacQueen, D. B. Coroutines and networks of parallel processes. In Information Processing 77, IFIP, North-Holland Publishing Company, New York, 1977, 993–998.
10. Manna, Z., Ness, S., and Vuillemin, J. Inductive methods for proving properties of programs. Commun. ACM 16, 8 (1973), 491–502.
11. Scott, D. Lectures on a Mathematical Theory of Computation. Tech. Monograph PRG-19, Programming Research Group, Oxford University Computing Lab., 1981.
12. Stoy, J. E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Mass., 1977.
13. Turner, D. A. Miranda: A non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture (LNCS 201), J. P. Jouannaud, Ed. Springer-Verlag, New York, 1985, pp. 1–16.
14. Turner, D. A. Functional programming and proofs of program correctness. In Tools and Notions for Program Construction, D. Neel, Ed., Cambridge Univ. Press, Cambridge, 1983, pp. 187–204.
15. Turner, D. A. Functional programs as executable specifications. In Mathematical Logic and Programming Languages, C. A. R. Hoare, and J. C. Shepherdson, Prentice-Hall International, Englewood Cliffs, N. J., 1985, pp. 29–54.
16. van de Snepscheut, J. L. A. An exercise of programming in SASL. Personal note JAN 106–3, California Institute of Technology, Pasadena, 1983.
17. Wadge, W. W. An extensional treatment of dataflow deadlock. Theoret. Comput. Sci. 13 (1981), 3–15.