Higher-Order Algebra, Logic, and Term Rewriting
First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers
Published on 28. July 1994
Book
Paperback/Softback
IX, 351 pages
978-3-540-58233-5 (ISBN)
Description
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.
More details
Series
Edition
1994 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
IX, 351 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 20 mm
Weight
546 gr
ISBN-13
978-3-540-58233-5 (9783540582335)
DOI
10.1007/3-540-58233-9
Schweitzer Classification
Persons
Content
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.