Reference. How to design co-programs

The observation that program structure follows data structure is a key lesson in introductory programming: good hints for possible program designs can be found by considering the structure of the data concerned. In particular, this lesson is a core message of the influential textbook “How to Design Programs” by Felleisen, Findler, Flatt, and Krishnamurthi. However, that book discusses using only the structure of input data for guiding program design, typically leading towards structurally recursive programs. We argue that novice programmers should also be taught to consider the structure of output data, leading them also towards structurally corecursive programs.

Cite

Cite as @gibbons-2021-how (helia, typst) · \cite{gibbons-2021-how} (LaTeX)
BibTeX
bibtex · 1 line
@article{gibbons-2021-how, title={How to design co-programs}, volume={31}, ISSN={1469-7653}, url={http://dx.doi.org/10.1017/s0956796821000113}, DOI={10.1017/s0956796821000113}, journal={Journal of Functional Programming}, publisher={Cambridge University Press (CUP)}, author={GIBBONS, JEREMY}, year={2021} }
hayagriva YAML (typst)
yaml · 14 lines
gibbons-2021-how:
  type: article
  title: How to design co-programs
  author: GIBBONS, JEREMY
  date: 2021
  url: http://dx.doi.org/10.1017/s0956796821000113
  serial-number:
    doi: 10.1017/s0956796821000113
    issn: 1469-7653
  parent:
    type: periodical
    title: Journal of Functional Programming
    publisher: Cambridge University Press (CUP)
    volume: 31
Cited by (1)

Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes yang-2022-fantastic

DOI · arXiv
Cites 16 works (0 here)
External (16)
gibbons-2021-how reference entries/refs/gibbons-2021-how/gibbons-2021-how.hel