Difference between revisions of "Functional Programming and Parallel Graph Rewriting"
From Clean
Jump to navigationJump to searchBas Lijnse (talk | contribs) |
(fix link) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[Image:FunctionalProgammingAndParallelGraphRewriting.gif|right|frame]] | [[Image:FunctionalProgammingAndParallelGraphRewriting.gif|right|frame]] | ||
| − | "Functional Programming and Parallel Graph Rewriting" written by Plasmeijer and Van Eekelen is published by Addison-Wesley in 1993 (ISBN 0-201-41663-8, 571 pages). It explains in detail the theoretical ideas behind Clean and shows how these ideas can be used to make an efficient implementation. [http://www. | + | "Functional Programming and Parallel Graph Rewriting" written by Plasmeijer and Van Eekelen is published by Addison-Wesley in 1993 (ISBN 0-201-41663-8, 571 pages). It explains in detail the theoretical ideas behind Clean and shows how these ideas can be used to make an efficient implementation. [http://www.sws.cs.ru.nl/publications/papers/1993/FPPGR.book.review.html Here is a review of the book]. |
== Book Content == | == Book Content == | ||
The book is available online in multiple parts: | The book is available online in multiple parts: | ||
| − | * [http://www. | + | * [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch00.Preface.ps Preface] |
* Part 1 FUNCTIONAL PROGRAMMING | * Part 1 FUNCTIONAL PROGRAMMING | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch01.Basic_Conc.ps 1. Basic concepts] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch02.Mira.ps 2. Advanced concepts: Miranda] |
* Part 2 MODELS OF COMPUTATION | * Part 2 MODELS OF COMPUTATION | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch03.Lam_Cal.ps 3. The l-calculus] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch04.TRS.ps 4. Term rewriting systems] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch05.GRS.ps 5. Graph rewriting systems] |
* Part 3 ANALYSIS OF FUNCTIONAL PROGRAMS | * Part 3 ANALYSIS OF FUNCTIONAL PROGRAMS | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch06.Typing.ps 6. Type assignment systems] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch07.Strictness.ps 7. Strictness analysis] |
* Part 4 IMPLEMENTATION ON SEQUENTIAL ARCHITECTURES | * Part 4 IMPLEMENTATION ON SEQUENTIAL ARCHITECTURES | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch08.Clean1.ps 8. Clean] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch09.Mira_to_Clean.ps 9. Translation into Clean] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch10.ABC.ps 10. The abstract ABC machine] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch11.Cl_to_ABC.ps 11. Translating Clean into ABC code] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch12.Concret.ABC.ps 12. Realizing the ABC machine] |
* Part 5 CONCURRENCY ISSUES | * Part 5 CONCURRENCY ISSUES | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch13.Basic_Conc.ps 13. Basic language concepts] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch14.GRS.ps 14. Parallel graph rewriting] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch15.ConcClean.ps 15. Concurrent Clean] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch16.PABC-Cl_to_PABC.ps 16. The Parallel ABC Machine] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/Ch17.Concret.PABC.ps 17. Realizing the PABC machine] |
* APPENDICES | * APPENDICES | ||
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChAppA.Mira_syntax.ps A. Syntax of the example programs] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChAppB.CoCl_syntax.ps B. Concurrent Clean syntax and library] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChAppC.ABC_def.ps C. ABC machine specification] |
| − | ** [http://www. | + | ** [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChAppD.PABC_def.ps D. PABC machine specification] |
| − | * [http://www. | + | * [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChBibliography.ps Bibliography] |
| − | * [http://www. | + | * [http://www.sws.cs.ru.nl/publications/papers/1993/plaseek93/ChIndex.ps Index] |
Latest revision as of 11:35, 4 April 2019
"Functional Programming and Parallel Graph Rewriting" written by Plasmeijer and Van Eekelen is published by Addison-Wesley in 1993 (ISBN 0-201-41663-8, 571 pages). It explains in detail the theoretical ideas behind Clean and shows how these ideas can be used to make an efficient implementation. Here is a review of the book.
Book Content
The book is available online in multiple parts:
- Preface
- Part 1 FUNCTIONAL PROGRAMMING
- Part 2 MODELS OF COMPUTATION
- Part 3 ANALYSIS OF FUNCTIONAL PROGRAMS
- Part 4 IMPLEMENTATION ON SEQUENTIAL ARCHITECTURES
- Part 5 CONCURRENCY ISSUES
- APPENDICES
- Bibliography
- Index
