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
  Bloom, Stephen Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  The equational logic of fixed points
Bloom S., Ésik Z. Theoretical Computer Science 179(1-2): 1-60, 1997.  Type: Article
The authors survey the category of partially ordered sets in which each partially ordered subset has a least upper bound. No proofs are given. They state that every endomorphism f (or every order-preserving map of a ...... 		Apr 1 1998  
  Free shuffle algebras in language varieties
Bloom S., Ésik Z. Theoretical Computer Science 163(1-2): 55-98, 1996.  Type: Article
An intimate relationship between series-parallel partially ordered sets and free shuffle algebras is revealed in this paper. Except for a brief introductory remark about parallel computation, it reads like a paper in abstract algebra, ...... 		Oct 1 1997  
  Iteration theories
Bloom S., Ésik Z., Springer-Verlag New York, Inc., New York, NY, 1993.  Type: Book (9780387563787)
This monograph contains the results of our joint research over the last ten years.…This book provides a detailed investigation of the properties of the fixed point or iteration operation.…It is shown that i......
May 1 1995  
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use | Privacy Policy