Sciweavers

ENTCS
2002
141views more  ENTCS 2002»
13 years 11 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
ENTCS
2002
118views more  ENTCS 2002»
13 years 11 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel
ENTCS
2007
101views more  ENTCS 2007»
13 years 11 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...