𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Akman, V.: Unobstructed Shortest Paths in Polyhedral Environments. Lecture Notes in Computer Science, Vol. 251, Springer-Verlag, Berlin a. o. 1987, 103 pp., DM 27,–. ISBN 3-540-17629-2

✍ Scribed by Th. Fischer

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
78 KB
Volume
31
Category
Article
ISSN
0323-3847

No coin nor oath required. For personal study only.

✦ Synopsis

This book is the published version of the author's Ph. D. the& written at Harvard Univemitg during 1986. It investigates the problem of translating eet-onented query specifications into iterative program by using techniques of functional programming and propam transformation.

📜 SIMILAR VOLUMES

Freytag, J. Ch.: Translating Relational
Freytag, J. Ch.: Translating Relational Queries into Iterative Programs. Lecture Notes in Computer Science, Vol. 261, Springer-Verlag, Berlin a. o. 1987, 131 pp., DM 27,–. ISBN 3-540-180000-1
✍ Th. Fischer 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 1 views

This book is the published version of the author's Ph. D. the& written at Harvard Univemitg during 1986. It investigates the problem of translating eet-onented query specifications into iterative program by using techniques of functional programming and propam transformation.