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,626
Discovery Miles 16 260
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,626 Discovery Miles 16 260 | Repayment Terms: R152 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 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..

Agent-Based Modeling and Network…
Akira Namatame, Shu-Heng Chen Hardcover R3,014 Discovery Miles 30 140
Digital Protection for Power Systems
Salman K. Salman, A.T. Johns Hardcover R3,891 Discovery Miles 38 910
Hidden Semi-Markov Models - Theory…
Shun-Zheng Yu Paperback R858 Discovery Miles 8 580
Numerical Time-Dependent Partial…
Moysey Brio, Gary M. Webb, … Hardcover R2,893 Discovery Miles 28 930
Conceptual Spaces: Elaborations and…
Mauri Kaipainen, Frank Zenker, … Hardcover R3,719 Discovery Miles 37 190
Restricted Congruences in Computing
Khodakhast Bibak Hardcover R1,776 Discovery Miles 17 760
Handbook of Research on Emerging Trends…
Arun Solanki, Sandeep Kumar, … Hardcover R11,100 Discovery Miles 111 000
Numerical Methods for Linear Control…
Biswa Datta Hardcover R2,284 Discovery Miles 22 840
Mathematics and Computing - ICMC 2018…
Debdas Ghosh, Debasis Giri, … Hardcover R4,119 R3,093 Discovery Miles 30 930
Modeling and Simulation with Compose and…
Stephen L. Campbell, Ramine Nikoukhah Hardcover R3,746 Discovery Miles 37 460
Handbook of Automated Reasoning, Volume…
Alan J.A. Robinson, Andrei Voronkov Hardcover R5,129 Discovery Miles 51 290
Essential Linear Algebra with…
Titu Andreescu Hardcover R2,914 Discovery Miles 29 140

See more

Partners