171
Voted
CALCO
15 years 11 months ago
2005 Springer 
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
154
click to vote
CALCO
15 years 11 months ago
2005 Springer 
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
177
click to vote
CALCO
15 years 11 months ago
2005 Springer 
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
163
click to vote
CALCO
15 years 11 months ago
2005 Springer 
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize tempor...
136
Voted
CALCO
15 years 11 months ago
2005 Springer 
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
|
Mathematics