Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Nipkow, Tobias Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 6 reviews    
  Term rewriting and all that
Baader F., Nipkow T. (ed), Cambridge University Press, New York, NY, 1998.  Type: Book (9780521779203)

The authors say that their book serves a double purpose by setting out material that is scattered in various specialized proceedings and journals (for researchers) and offering a readable textbook (for students)....
...
Feb 1 2000  
  Term rewriting and all that
Baader F., Nipkow T. (ed), Cambridge University Press, New York, NY, 1998.  Type: Book (9780521455206)

The authors’ aim is to provide a textbook, the first in English, on term rewriting theory and applications. The material is divided into two courses or levels (call them C1 and C2), and also partitioned into “basic&...
...
Nov 1 1999  
  Combining matching algorithms
Nipkow T. (ed) Journal of Symbolic Computation 12(6): 633-653, 1991.  Type: Article

Nipkow partly solves a fundamental problem in equational matching, which is a fundamental problem in symbolic computation. Let s and t be terms (for example, s could be ...
...
Aug 1 1993  
  Unification in primal algebras, their powers and their varieties
Nipkow T. (ed) Journal of the ACM 31(4): 742-776, 1984.  Type: Article

Unification, a fundamental operation in computer science and mathematics, has been studied in a wide variety of settings in recent years. This paper makes a significant contribution to unification theory by studying a particular kind o...
...
Dec 1 1991  
  Boolean unification--the story so far
Martin U., Nipkow T. (ed) Journal of Symbolic Computation 7(3-4): 275-293, 1989.  Type: Article

This paper provides a reasonably good summary of the current state of research into unification in Boolean rings. Beginning with the essentials on Boolean rings, the paper proceeds to describe two algorithms for Boolean unification. A ...
...
Mar 1 1990  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy