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.
Author(s): Andrea Asperti, Cosimo Laneve (auth.), Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow (eds.)
Series: Lecture Notes in Computer Science 816
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 351
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Mathematical Logic and Foundations
Interaction systems....Pages 1-19
Strong normalization of typeable rewrite systems....Pages 20-39
A transformation system combining partial evaluation with term rewriting....Pages 40-55
Prototyping relational specifications using higher-order objects....Pages 56-75
Origin tracking for higher-order term rewriting systems....Pages 76-95
Theory interpretation in simple type theory....Pages 96-123
The semantics of SPECTRUM....Pages 124-145
ATLAS : A typed language for algebraic specification....Pages 146-168
Compilation of Combinatory Reduction Systems....Pages 169-188
Specification and verification in higher order algebra: A case study of convolution....Pages 189-222
Ordered and continuous models of higher-order specifications....Pages 223-255
Rewriting properties of combinators for rudimentary linear logic....Pages 256-275
Comparing combinatory reduction systems and higher-order rewrite systems....Pages 276-304
Termination proofs for higher-order rewrite systems....Pages 305-325
Extensions of initial models and their second-order proof systems....Pages 326-344
