Boleslaw Mikolajzak, Ph .D . Associate Professor of Computer Scienc e University of Massachusetts Dartmout h North Dartmouth, Massachusett s Programs, Recursion and Unbounded Choice . By Wim H. University Press, 1992 . xii+223 pages. ISBN 0-521-40436-3 . $39 .95 . Hesselink . Cambridge Over the last twenty odd years programming has evolved from a black art to a matur e subject that has been described as a science [4], an art [6], a craft [9] and even as a discipline [3] . Despite the diversity of views expressed by the authors cited, there has bee n a remarkable convergence of ideas and methods . This goes beyond recognizing program s as mathematical objects . It is agreed that programs describe functions, that computabl e functions are continuous, in some appropriate sense, that iterative and recursive construct s are to be understood via induction principles, and that logic is permanently wedded to computer science (The official ceremony was performed by Dana Scott at the LICS conferenc e in Asilomar in 1989) . Any list, such as the one I have foolishly attempted above, will be necessarily incomplet e and occasionally misleading . Thus, in particular for operating systems
End of preview. The entire article is 4 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/book-review-programs-recursion-and-unbounded-choice-by-wim-h-hesselink-2v1t0EnBGi
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Book Review: Programs, Recursion and Unbounded Choice. By Wim H. Hesselink. (Cambridge University Press, 1992. xii+223 pages. ISBN 0-521-40436-3. $39 .95)
Reviewer-Panangaden, Prakesh
Follow ACM SIGACT News
, Volume 24 (3)
Association for Computing Machinery – Oct 1, 1993
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
