CALCO

2005

Springer

14 years 2 months ago
2005

Springer

Following the paradigm of encapsulation of side eﬀects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

CALCO

2005

Springer

14 years 2 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...

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

Simulations are a very natural way of relating concurrent systems, which are mathematically modeled by Kripke structures. The range of available notions of simulations makes it ver...

CALCO

2005

Springer

14 years 2 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...

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

Every endofunctor B on the category Set can be lifted to a ﬁbred functor on the category (ﬁbred over Set) of equivalence relations and relation-preserving functions. In this pa...

CALCO

2005

Springer

14 years 2 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 ...

CALCO

2005

Springer

14 years 2 months ago
2005

Springer

In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only ﬁnite-length strings) we introduce a general a...