Inductive completion with retracts
Inductive completion with retracts
In this paper we give countably infinitely many extensions of Huet and Hullot's inductive completion procedure. Also we try and throw some light on the problem of functions which are only partially defined by some set of rewrite rules. We also give a procedure which attempts to show that two derived F-algebras are isomorphic when both of the algebras are realised as retracts.
497-514
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
1988
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
Mitchell, Bill
(1988)
Inductive completion with retracts.
Acta Informatica, 25 (5), .
(doi:10.1007/BF00279951).
Abstract
In this paper we give countably infinitely many extensions of Huet and Hullot's inductive completion procedure. Also we try and throw some light on the problem of functions which are only partially defined by some set of rewrite rules. We also give a procedure which attempts to show that two derived F-algebras are isomorphic when both of the algebras are realised as retracts.
Other
Ind_Compl.ps
- Other
More information
Published date: 1988
Organisations:
Electronics & Computer Science, IT Innovation
Identifiers
Local EPrints ID: 266061
URI: http://eprints.soton.ac.uk/id/eprint/266061
PURE UUID: 33be0dea-0234-4449-aa87-4bf5ed3a93c0
Catalogue record
Date deposited: 04 Jul 2008 21:05
Last modified: 14 Mar 2024 08:20
Export record
Altmetrics
Contributors
Author:
Bill Mitchell
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics