Recursion via Pascal
This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1984
|
| Schriftenreihe: | Cambridge computer science texts
19 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139171793 | ||
| 003 | UkCbUP | ||
| 005 | 20160201060150.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 111013s1984||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139171793 | ||
| 100 | 1 | |a Rohl, J. S. |d 1938- | |
| 245 | 1 | 0 | |a Recursion via Pascal |c J.S. Rohl |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1984 | |
| 300 | |a 1 Online-Ressource (x, 191 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge computer science texts |v 19 | |
| 520 | |a This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521263290 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521269346 |
| 856 | 4 | 0 | |l TUM01 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139171793 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781139171793 |
|---|---|
| _version_ | 1818779682518073344 |
| adam_text | |
| any_adam_object | |
| author | Rohl, J. S. 1938- |
| author_facet | Rohl, J. S. 1938- |
| author_role | |
| author_sort | Rohl, J. S. 1938- |
| author_variant | j s r js jsr |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| doi_str_mv | 10.1017/CBO9781139171793 |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01716nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139171793</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20160201060150.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">111013s1984||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139171793</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rohl, J. S.</subfield><subfield code="d">1938-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursion via Pascal</subfield><subfield code="c">J.S. Rohl</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 191 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge computer science texts</subfield><subfield code="v">19</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521263290</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521269346</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9781139171793</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781139171793 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-18T12:04:30Z |
| institution | BVB |
| isbn | 9781139171793 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 191 Seiten) |
| psigel | ZDB-20-CTM |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge computer science texts |
| spelling | Rohl, J. S. 1938- Recursion via Pascal J.S. Rohl Cambridge Cambridge University Press 1984 1 Online-Ressource (x, 191 Seiten) txt c cr Cambridge computer science texts 19 This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples. Erscheint auch als Druck-Ausgabe 9780521263290 Erscheint auch als Druck-Ausgabe 9780521269346 TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/CBO9781139171793 Volltext |
| spellingShingle | Rohl, J. S. 1938- Recursion via Pascal |
| title | Recursion via Pascal |
| title_auth | Recursion via Pascal |
| title_exact_search | Recursion via Pascal |
| title_full | Recursion via Pascal J.S. Rohl |
| title_fullStr | Recursion via Pascal J.S. Rohl |
| title_full_unstemmed | Recursion via Pascal J.S. Rohl |
| title_short | Recursion via Pascal |
| title_sort | recursion via pascal |
| url | https://doi.org/10.1017/CBO9781139171793 |
| work_keys_str_mv | AT rohljs recursionviapascal |