69 search results - page 1 / 14 » Corecursive Algebras: A Study of General Structured Corecurs... |
SBMF
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...
ENTCS
2006
13 years 4 months ago
2006
In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given...
TAP
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents techniques for applying a finite relational model finder to logical specifications that involve (co)inductive predicates, (co)algebraic datatypes, and (co)re...
JUCS
2006
13 years 4 months ago
2006
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
JALC
2007
13 years 4 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...