product iamge

Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, HOA '95 Paderborn, Germany, September 21–22, 1995 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book presents a collection of revised refereed papers selected from the presentations accepted for the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, HOA '95, held in Paderborn, Germany, in September 1995.
The 14 research papers included, together with an invited paper by Jan Willem Klop, report state-of-the-art results; the relevant theoretical aspects are addressed, and in addition existing proof systems and term rewriting systems are discussed.

Author(s): Jan Willem Klop (auth.), Gilles Dowek, Jan Heering, Karl Meinke, Bernhard Möller (eds.)
Series: Lecture Notes in Computer Science 1074
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996

Language: English
Pages: 296
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Mathematical Logic and Foundations

Term graph rewriting....Pages 1-16
Approximation and normalization results for typeable term rewriting systems....Pages 17-36
Modular properties of algebraic type systems....Pages 37-56
Collapsing partial combinatory algebras....Pages 57-73
A complete proof system for Nested Term Graphs....Pages 74-89
R n - and G n -logics....Pages 90-108
The variable containment problem....Pages 109-123
Higher-order equational logic for specification, simulation and testing....Pages 124-143
The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving....Pages 144-162
Assertions and recursions....Pages 163-184
Development closed critical pairs....Pages 185-200
Two different strong normalization proofs?....Pages 201-220
Third-order matching in the polymorphic lambda calculus....Pages 221-237
Higher-order algebra with transfinite types....Pages 238-263
Abstraction of hardware construction....Pages 264-287