Algorithmic languages and calculi : IFIP TC2 WG2.1 International Workshop on Algorithmic Languages and Calculi 17-22 February 1997, Alsace, France
Author(s)
Bibliographic Information
Algorithmic languages and calculi : IFIP TC2 WG2.1 International Workshop on Algorithmic Languages and Calculi 17-22 February 1997, Alsace, France
Chapman & Hall, 1997
Available at 3 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographies and index
Description and Table of Contents
Description
The general theme of this conference is notations, methods, and tool support for the calculation of programs from specifications. The purpose of this working conference is to present the results of ongoing research, descriptions of existing and proposed systems, and applications to the production of practical software.
Table of Contents
Preface. Programme committee. Dynamic programming: a different perspective - S. Curtis. Calculating with pointer structures - B. Moller. Deriving a systolic regular language recognizer - M. Vaccarri and R. Backhouse. Discussion. A calculation fusion system HYLO - Y. Onoue, Z. Hu, H. Iwasaki and M. Takeichi. Refinement of data parallel programs in PEI - E. Violard, S. Genaud and G-R. Perrin. Solving large systems of differential equations in parallel using covers and skeletons - M. Sudholt, C. Piepenbrock, K. Obermayer and P. Pepper. Discussion. Refinement of parameterized algebraic specifications - Y.V. Srinivas. Towards a compositional interpretation of object diagrams - J.C. Bicarregui, K.C. Lano and T.S.E. Maibaum. A powerful transformation rule, its applications and variants - K. Achatz and H. Partsch. Program derivation via list introduction - A. Pettorossi and M. Proietti. Towards a calculus for abstract syntax trees - D.S. Wile. Discussion. Principled strength reduction - Y.A. Liu. The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset - D. Goyal and R. Paige. Predicative semantics of loops - T.S. Norvell. Discussion. Index of contributors. Keyword index.
by "Nielsen BookData"