RAIRO-Theor. Inf. Appl.
Volume 37, Number 4, October-December 2003Fixed Points in Computer Science (FICS'02)
|Page(s)||301 - 314|
|Published online||15 January 2004|
Solving Algebraic Equations Using Coalgebra
Mathematics and Computer Science, University of Leicester; email@example.com., firstname.lastname@example.org.
2 FB 3 – Mathematics and Computer Science, Universität Bremen; email@example.com.
Accepted: 6 August 2003
Algebraic systems of equations define functions using recursion where parameter passing is permitted. This generalizes the notion of a rational system of equations where parameter passing is prohibited. It has been known for some time that algebraic systems in Greibach Normal Form have unique solutions. This paper presents a categorical approach to algebraic systems of equations which generalizes the traditional approach in two ways i) we define algebraic equations for locally finitely presentable categories rather than just Set; and ii) we define algebraic equations to allow right-hand sides which need not consist of finite terms. We show these generalized algebraic systems of equations have unique solutions by replacing the traditional metric-theoretic arguments with coalgebraic arguments.
Mathematics Subject Classification: 18C10 / 18C35 / 18C50
Key words: Coalgebra / recursion / category theory.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.