Overview

This volume contains the final revised versions of the best papers presented at the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting (HOA '93), held in Amsterdam in September 1993. Higher-Order methods are increasingly applied in functional and logic programming languages, as well as in specification and verification of programs and hardware. The 15 full papers in this volume are devoted to the algebra and model theory of higher-order languages, computational logic techniques including resolution and term rewriting, and specification and verification case studies; in total they provide a competently written overview of current research and suggest new research directions in this vigourous area.

Full Product Details

Author:   Jan Heering ,  Karl Meinke ,  Bernhard Möller ,  Tobias Nipkow
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1994 ed.
Volume:   816
Dimensions:   Width: 15.20cm , Height: 1.90cm , Length: 22.90cm
Weight:   1.130kg
ISBN:  

9783540582335

ISBN 10:   3540582339
Pages:   351
Publication Date:   28 July 1994
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Interaction systems.- Strong normalization of typeable rewrite systems.- A transformation system combining partial evaluation with term rewriting.- Prototyping relational specifications using higher-order objects.- Origin tracking for higher-order term rewriting systems.- Theory interpretation in simple type theory.- The semantics of SPECTRUM.- ATLAS: A typed language for algebraic specification.- Compilation of Combinatory Reduction Systems.- Specification and verification in higher order algebra: A case study of convolution.- Ordered and continuous models of higher-order specifications.- Rewriting properties of combinators for rudimentary linear logic.- Comparing combinatory reduction systems and higher-order rewrite systems.- Termination proofs for higher-order rewrite systems.- Extensions of initial models and their second-order proof systems.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions