0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

A Proof Theory for General Unification (Hardcover, 1991 ed.) Loot Price: R1,505
Discovery Miles 15 050
A Proof Theory for General Unification (Hardcover, 1991 ed.): W Snyder

A Proof Theory for General Unification (Hardcover, 1991 ed.)

W Snyder

Series: Progress in Computer Science and Applied Logic, 11

 (sign in to rate)
Loot Price R1,505 Discovery Miles 15 050 | Repayment Terms: R141 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems."

General

Imprint: Birkhauser Boston
Country of origin: United States
Series: Progress in Computer Science and Applied Logic, 11
Release date: November 1991
First published: 1991
Authors: W Snyder
Dimensions: 235 x 155 x 12mm (L x W x T)
Format: Hardcover
Pages: 178
Edition: 1991 ed.
ISBN-13: 978-0-8176-3593-0
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Promotions
LSN: 0-8176-3593-9
Barcode: 9780817635930

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Creativity in Computing and DataFlow…
Suyel Namasudra, Veljko Milutinovic Hardcover R4,204 Discovery Miles 42 040
Agent-Based Modeling and Network…
Akira Namatame, Shu-Heng Chen Hardcover R2,970 Discovery Miles 29 700
Fibonacci Cubes With Applications And…
Omer Egecioglu, Sandi Klavzar, … Hardcover R2,380 Discovery Miles 23 800
Digital Protection for Power Systems
Salman K. Salman, A.T. Johns Hardcover R3,128 R2,831 Discovery Miles 28 310
Theory and Computation of Tensors…
Yimin Wei, Weiyang Ding Paperback R1,372 Discovery Miles 13 720
Advanced Topics in Bisimulation and…
Davide Sangiorgi, Jan Rutten Hardcover R3,356 Discovery Miles 33 560
Pop-Up Geometry - The Mathematics Behind…
Joseph O'Rourke Hardcover R1,788 Discovery Miles 17 880
Distributed Algorithms
Nancy A. Lynch Hardcover R3,669 R3,201 Discovery Miles 32 010
Numerical Time-Dependent Partial…
Moysey Brio, Gary M. Webb, … Hardcover R3,033 R2,850 Discovery Miles 28 500
Computational Electrodynamics - The…
Allen Taflove Hardcover R4,574 Discovery Miles 45 740
Restricted Congruences in Computing
Khodakhast Bibak Hardcover R1,666 Discovery Miles 16 660
Conceptual Spaces: Elaborations and…
Mauri Kaipainen, Frank Zenker, … Hardcover R3,112 Discovery Miles 31 120

See more

Partners