From mboxrd@z Thu Jan  1 00:00:00 1970
X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/2004
Path: news.gmane.org!not-for-mail
From: Stephen Bloom <bloom@guinness.cs.stevens-tech.edu>
Newsgroups: gmane.science.mathematics.categories
Subject: iteration vs. recursion
Date: Thu,  7 Jun 2001 10:55:55 -0400 (EDT)
Message-ID: <20010607145555.9BC27699AD@timmermans.cs.stevens-tech.edu>
Reply-To: bloom@cs.stevens-tech.edu
NNTP-Posting-Host: main.gmane.org
X-Trace: ger.gmane.org 1241018276 1686 80.91.229.2 (29 Apr 2009 15:17:56 GMT)
X-Complaints-To: usenet@ger.gmane.org
NNTP-Posting-Date: Wed, 29 Apr 2009 15:17:56 +0000 (UTC)
To: categories@mta.ca
Original-X-From: rrosebru@mta.ca Fri Jun  8 00:28:40 2001 -0300
Return-Path: <cat-dist@mta.ca>
Original-Received: (from Majordom@localhost)
	by mailserv.mta.ca (8.11.1/8.11.1) id f582vmm18579
	for categories-list; Thu, 7 Jun 2001 23:57:48 -0300 (ADT)
X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f
Original-Sender: cat-dist@mta.ca
Precedence: bulk
X-Keywords: 
X-UID: 14
Original-Lines: 35
Xref: news.gmane.org gmane.science.mathematics.categories:2004
Archived-At: <http://permalink.gmane.org/gmane.science.mathematics.categories/2004>


Both iteration and recursion are operations
yielding fixed points.  They have the same
equational properties in standard models.

See the following articles:

S. Bloom and Z. Esik,``Fixed point operations in ccc's'', Theoretical
Computer Science, 
155:1996, 1--38, 

S. Bloom and Z. Esik,``The equational logic of fixed points'' ,
Theoretical Computer Science, 179(1997), 1--60,

and

Z. Esik and A. Labella:
Equational properties of iteration in
algebraically complete categories.
Mathematical foundations of computer
science (Cracow, 1996).
Theoret. Comput. Sci. 195 (1998), no. 1, 61--89.

and the book:

Iteration Theories: The Equational Logic of Iterative Processes,
EATCS Monograph Series on Theoretical  Computer Science, 
Springer-Verlag,  1993
ISBN 0-387-56378-4, by Bloom and Esik.