IV Higher Order Workshop, Banff 1990 : proceedings of the IV Higher Order Workshop, Banff, Alberta, Canada, 10-14 September 1990
Author(s)
Bibliographic Information
IV Higher Order Workshop, Banff 1990 : proceedings of the IV Higher Order Workshop, Banff, Alberta, Canada, 10-14 September 1990
（Workshops in computing）
Springer-Verlag, c1991
- : uk
- : us
- Other Title
-
Fourth Higher Order Workshop, Banff 1990
4th Higher Order Workshop, Banff 1990
Available at / 5 libraries
-
No Libraries matched.
- Remove all filters.
Note
"Published in collaboration with the British Computer Society."
Includes bibliographical references and index
Description and Table of Contents
Description
It is many years since Landin, Burge and others showed us how to apply higher order techniques and thus laid some foundations for modern functional programming. The advantage of higher order descriptions - that they can be very succinct and clear - has been percolating through ever since. Current research topics range from the design, implementation and use of higher order proof assistants and theorem provers, through program specification and verification, and programming language design, to its applications in hardware description and verification. The papers in this book represent the presentations made at a workshop held at Banff, Canada, September 10-14 1990 and organised by the Computer Science Department of the University of Calgary. The workshop gathered together researchers interested in applying higher order techniques to a range of problems. The workshop format had a few (but fairly long) presentations per day. This left ample time for healthy discussion and argument, many of which continued on into the small hours. With so much to choose from, the program had to be selective. This year's workshop was divided into five parts: 1. Expressing and reasoning about concurrency: Warren Burton and Ken Jackson, John Hughes, and Faron Moller. 2. Reasoning about synchronous circuits: Geraint Jones and Mary Sheeran (with a bonus on the fast Fourier transform from Geraint). 3. Reasoning about asynchronous circuits: Albert Camilleri, Jo Ebergen, and Martin Rem. 4. Categorical concepts for programming languages: Robin Cockett, Barry Jay, and Andy Pitts.
Table of Contents
Partially Deterministic Functions.- Nondeterministic Functional Programming with Sets.- Algebra as a Tool for Real Time Analysis.- The Study of Butterflies.- Sorts of Butterflies.- A Fast Flutter by the Fourier Transform.- Parallel Computations and Delay-Insensitive Circuits.- The Nature of Delay-Insensitive Computing.- A Higher Order Logic Mechanization of the CSP Failures-Divergence Semantics.- Partial Functions, Ordered Categories, Limits and Cartesian Closure.- Evaluation Logic.- Conditional Control is Not Quite Categorical Control.- Simple Type Theory in EVES.- Formal Synthesis.- Proving (Facts About) Ruby.- Author Index.
by "Nielsen BookData"
