Sciweavers

CALCO
2005
Springer
126views Mathematics» more  CALCO 2005»
15 years 2 months ago
Context-Free Languages via Coalgebraic Trace Semantics
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...
Ichiro Hasuo, Bart Jacobs
CALCO
2005
Springer
119views Mathematics» more  CALCO 2005»
15 years 2 months ago
The Category Theoretic Solution of Recursive Program Schemes
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...
Stefan Milius, Lawrence S. Moss
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
15 years 2 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
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 ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
CALCO
2005
Springer
109views Mathematics» more  CALCO 2005»
15 years 2 months ago
Final Semantics for Event-Pattern Reactive Programs
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...
César Sánchez, Henny B. Sipma, Matte...
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
15 years 2 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
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...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
Mathematics
Top of PageReset Settings