Proceedings of the Nineteenth SIGCSE Technical Symposium on Computer Science Education - SIGCSE '88 1988
DOI: 10.1145/52964.53029
|View full text |Cite
|
Sign up to set email alerts
|

Teaching recursion using fractals in Prolog

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

1993
1993
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…Those introductory courses that have used graphics have often used turtle graphics (Elenbogen and O'Kennon, 1988;Liss and McMillan, 1987), first used in LOGO to teach computing to children (Papert, 1980). A picture can be drawn by giving a sequence of commands to a robot turtle, of the form move Forward distance, turn Right angle, lift Pen Up, and put Pen Down.…”
Section: Turtle Graphicsmentioning
confidence: 99%
“…Those introductory courses that have used graphics have often used turtle graphics (Elenbogen and O'Kennon, 1988;Liss and McMillan, 1987), first used in LOGO to teach computing to children (Papert, 1980). A picture can be drawn by giving a sequence of commands to a robot turtle, of the form move Forward distance, turn Right angle, lift Pen Up, and put Pen Down.…”
Section: Turtle Graphicsmentioning
confidence: 99%
“…It is often claimed that everyday life lacks analogies for the concept of recursion (Pirolli and Anderson, 1985), so it is no surprise that most authors come up with the same objects, such as cauliflowers, including the healthy broccoli, ringed targets, tree branches, reflections on facing mirrors, tilings (Chu and Johnsonbaugh, 1987), ladders (Levy and Lapidot, 2002) and Russian dolls (Bowman and Seagraves, 1985). Typical geometric figures are fractals (Riordon, 1984b, Elenbogen and O'Kennon, 1988, Wakin, 1989, Bruce et al, 2005, Ammari-Allahyari, 2005, Stephenson, 2009b, Gordon, 2006 and certain kinds of artwork, most notably by the Dutch graphic artist M. C. Escher (Gunion et al, 2009b). Their structures are characterised by self-replication with selfembedding (also called nesting), but, unfortunately, these examples are perhaps more likely to suggest infinity than recursion (whose evaluation must terminate to be useful and, in the case of embedded recursion, may require backtracking), and this involuntary association of infinity and recursion may explain the avoidance of the latter by novices (Wiedenbeck, 1989).…”
Section: Analogies Objectsmentioning
confidence: 99%
“…None of these three languages are mainstream first programming languages. However, Z and Prolog [14] are used in the courses on discrete mathematics that often run in parallel with the first programming course. We include Pizza in our selection of languages because we feel that it would be an interesting alternative to Java as a first language [15,16].…”
Section: Appendix B Using Z Prolog and Pizzamentioning
confidence: 99%