Displaying similar documents to “Categorical, functorial and algebraic aspects of the type-free lambda calculus”

Solving algebraic equations using coalgebra

Federico De Marchi, Neil Ghani, Christoph Lüth (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

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...

Object oriented institutions to specify symbolic computation systems

César Domínguez, Laureano Lambán, Julio Rubio (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational...