Algebraic solutions to recursion schemes
Authors:
- David B. BensonDBDavid B. Benson
- Irène GuessarianIGIrène Guessarian
- 1 December 1987
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 35 (3) , 365-400
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Fixed points in free process algebras, part ITheoretical Computer Science, 1989
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Completions of Partially Ordered SetsSIAM Journal on Computing, 1982
- The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive DefinitionsJournal of the ACM, 1982
- Tree constructions of free continuous algebrasJournal of Computer and System Sciences, 1982
- Metric interpretations of infinite trees and semantics of non deterministic recursive programsTheoretical Computer Science, 1980
- Parameter passing in nondeterministic recursive programsJournal of Computer and System Sciences, 1979
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Varieties of ordered algebrasJournal of Computer and System Sciences, 1976
- Natural state transformationsJournal of Computer and System Sciences, 1975