Miser Project Readings

Functional Programming Systems

Last updated 2002-07-11-14:56 -0700 (pdt)

see also:

Readings in Logic
Readings in Computation Theory
Readings in Programming Tools and Languages


[Abelson1996]

Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover).
     2000-07-18: People keep referring me to this book, though I can't ever remember liking it very much. So I got it anyhow. I think what bothers me is that it only uses one computer language, Scheme, to make its points. And it does have lots of material. Lots of material. And it addresses topics I say I care about. So I have the book and I will make the effort.

[Burge1975]

Burge, William H. Recursive Programming Techniques. Addison-Wesley (Reading, MA: 1975). ISBN 0-201-14450-6.
     2000-07-18: Cool ideas of functions to explore as good ways to represent all kinds of things. Section 1.8 to the end of Chapter 1 deals with all of the lambda-calculus and combinatory logic material important for the Miser Project. Burge's Reprogramming Machine paper needs to be located if the material isn't included in here.

[Felleisen1996]

Friedman, Daniel P., Felleisen, Matthias. The Little Schemer. ed.4. MIT Press (Cambridge, MA: 1974, 1986, 1987, 1989, 1996). ISBN 0-262-56099-2 (pbk: alk. paper). See [Friedman1996]

[Friedman1996]

Friedman, Daniel P., Felleisen, Matthias. The Little Schemer. ed.4. MIT Press (Cambridge, MA: 1974, 1986, 1987, 1989, 1996). ISBN 0-262-56099-2 (pbk: alk. paper).
     2000-07-18: This is the current form of The Little LISPer. I found the sequel, The Seasoned Schemer, at the University Bookstore in Seattle, but have resisted. This was something to get more hands-on familiarity with Scheme, since there are nice free implementations. I chose Dr.Scheme because it is used in education projects.
     I have already worked through Chapter 1 and have copious notes on how I wouldn't do it that way. I am following the guidelines of the book. I am looking at their typographical conventions to help me choose mine, but not sure how it will go.

[Okasaki1998]

Okasaki, Chris. Purely Functional Data Structures. Cambridge University Press (Cambridge: 1998). ISBN 0-521-66350-4 pbk.
     Addresses the problem of creating interesting data structures in a purely-functional setting.
     2000-07-18: Since the Miser Engine produces purely-functional results using an eager evaluator (a distinction I got from browsing this book), something to look into. The examples and worked definitions are all in ML, so then I grabbed [Paulson1996] when I ran across it.

[Paulson1996]

Paulson, Lawrence C. ML for the Working Programmer. Cambridge University Press (Cambridge: 1991, 1996). ISBN 0-521-56543-X pbk.
     2000-07-18: Because the [Okasaki1998] programs are all provided in ML, this seemed like a good idea. I am yet to find out what "ML" stands for, but I gave up my thin little specifications a move or two ago. Now I need to find a free implementation of Standard ML.

[Reynolds1998]

Reynolds, John C. Theories of Programming Languages. Cambridge University Press (Cambridge: 1998). ISBN 0-521-59414-6 hardback.
     2000-07-18: I bought this as an antidote to [Abelson1996]. There is far more than I need, but it is also covers some concepts that I can refer to.

[Sussman1996]

Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover).  See [Abelson1996]

[SussmanJ1996]

Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover).   See [Abelson1996]
see also:: Readings in Logic
Readings in Computation Theory
Readings in Programming Tools and Languages
[Abelson1996]: Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover).
2000-07-18: People keep referring me to this book, though I can't ever remember liking it very much. So I got it anyhow. I think what bothers me is that it only uses one computer language, Scheme, to make its points. And it does have lots of material. Lots of material. And it addresses topics I say I care about. So I have the book and I will make the effort.
[Burge1975]: Burge, William H. Recursive Programming Techniques. Addison-Wesley (Reading, MA: 1975). ISBN 0-201-14450-6.
2000-07-18: Cool ideas of functions to explore as good ways to represent all kinds of things. Section 1.8 to the end of Chapter 1 deals with all of the lambda-calculus and combinatory logic material important for the Miser Project. Burge's Reprogramming Machine paper needs to be located if the material isn't included in here.
[Felleisen1996]: Friedman, Daniel P., Felleisen, Matthias. The Little Schemer. ed.4. MIT Press (Cambridge, MA: 1974, 1986, 1987, 1989, 1996). ISBN 0-262-56099-2 (pbk: alk. paper). See [Friedman1996]

[Friedman1996]: Friedman, Daniel P., Felleisen, Matthias. The Little Schemer. ed.4. MIT Press (Cambridge, MA: 1974, 1986, 1987, 1989, 1996). ISBN 0-262-56099-2 (pbk: alk. paper).
2000-07-18: This is the current form of The Little LISPer. I found the sequel, The Seasoned Schemer, at the University Bookstore in Seattle, but have resisted. This was something to get more hands-on familiarity with Scheme, since there are nice free implementations. I chose Dr.Scheme because it is used in education projects.
I have already worked through Chapter 1 and have copious notes on how I wouldn't do it that way. I am following the guidelines of the book. I am looking at their typographical conventions to help me choose mine, but not sure how it will go.
[Okasaki1998]: Okasaki, Chris. Purely Functional Data Structures. Cambridge University Press (Cambridge: 1998). ISBN 0-521-66350-4 pbk.
Addresses the problem of creating interesting data structures in a purely-functional setting.
2000-07-18: Since the Miser Engine produces purely-functional results using an eager evaluator (a distinction I got from browsing this book), something to look into. The examples and worked definitions are all in ML, so then I grabbed [Paulson1996] when I ran across it.

[Paulson1996]: Paulson, Lawrence C. ML for the Working Programmer. Cambridge University Press (Cambridge: 1991, 1996). ISBN 0-521-56543-X pbk.
2000-07-18: Because the [Okasaki1998] programs are all provided in ML, this seemed like a good idea. I am yet to find out what "ML" stands for, but I gave up my thin little specifications a move or two ago. Now I need to find a free implementation of Standard ML.
[Reynolds1998]: Reynolds, John C. Theories of Programming Languages. Cambridge University Press (Cambridge: 1998). ISBN 0-521-59414-6 hardback.
2000-07-18: I bought this as an antidote to [Abelson1996]. There is far more than I need, but it is also covers some concepts that I can refer to.
[Sussman1996]: Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover). See [Abelson1996]

[SussmanJ1996]: Abelson, Harold., Sussman, Gerald Jay., Sussman, Julie. Structure and Interpretation of Computer Programs. ed.2. MIT Press (Cambridge, MA: 1996). ISBN 0-07-000484-6 (McGraw-Hill hardcover). See [Abelson1996]

created 2000-07-18-17:03 -0700 (pdt) by orcmid
$$Author: Orcmid $
$$Date: 02-10-13 21:29 $
$$Revision: 11 $

Home