Books

Theory and Practice

Kahn, Ken

The Learner's Apprentice: AIand the Aplification of Human Creativity

CMK Press, 2025

Minsky, Marvin

Inventive Minds: Marvin Minsky on Education

MIT Press, 2025

Papert, Seymour

Mindstorms

Basic Books, 1981, New York.

PDF version

Resnick, Mitchel

Lifelong Kindergarten

MIT Press, 2017

Papert, Seymour

The Children’s Machine

Basic Books, 1993, New York.

Solomon, Cynthia

Computer Environments for Children

MIT Press, 1986, Cambridge.

PDF version

Goldenberg, E. Paul and Feurzig, Wallace

Exploring Language with Logo

MIT Press, 1987, Cambridge

Abelson, Hal and di Sessa, Andy

Turtle Geometry

MIT Press, 1981, Cambridge

Watt, Daniel

Learning with Logo

Watt, Molly and Watt, Daniel

Teaching with Logo

Birch, Alison

The Logo Project Book

Terrapin Software, Inc.

Fitch, Dorothy

101 Ideas For Logo

Terrapin Software, Inc.

Harvey, Brian

Computer Science Logo Style, Vol. 1: Symbolic Computing

MIT Press, 1997, Cambridge. Click here to access pdf version of Volume 1 A Logo programming text that concentrates on natural language processing rather than the graphics most people associate with Logo. Teaches powerful functional programming techniques: recursion and higher order functions. Projects inspired by artificial intelligence, eg., a program that solves pitcher-pouring problems like the ones on IQ tests.

Harvey, Brian

Computer Science Logo Style, Vol. 1: Symbolic Computing

MIT Press, 1997, Cambridge. Click here to access pdf version of Volume 1 A Logo programming text that concentrates on natural language processing rather than the graphics most people associate with Logo. Teaches powerful functional programming techniques: recursion and higher order functions. Projects inspired by artificial intelligence, eg., a program that solves pitcher-pouring problems like the ones on IQ tests.

Harvey, Brian

Computer Science Logo Style, Vol. 3: Beyond Programming, MIT Press, 1997, Cambridge. Click here to access pdf version of Volume 3. A sampler of advanced undergraduate computer science courses: automata theory, discrete math, compilers, artificial intelligence. The ideas are presented not as formal theorems and proofs, but in the form of concrete, usable computer programs. (Examples include a program to translate from the declarative Regular Expression formalism into the executable Finite State Machine notation, and a Pascal compiler written in Logo.)