ISBN-10:
3540582339
ISBN-13:
9783540582335
Pub. Date:
09/09/1994
Publisher:
Springer Berlin Heidelberg
Higher-Order Algebra, Logic, and Term Rewriting: First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers / Edition 1

Higher-Order Algebra, Logic, and Term Rewriting: First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers / Edition 1

Paperback

Current price is , Original price is $109.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

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.

Product Details

ISBN-13: 9783540582335
Publisher: Springer Berlin Heidelberg
Publication date: 09/09/1994
Series: Lecture Notes in Computer Science , #816
Edition description: 1994
Pages: 351
Product dimensions: 5.98(w) x 9.02(h) x 0.03(d)

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.

Customer Reviews