Coinductive Interpreters for Process Calculi

Authors:
Luís Soares Barbosa;José Nuno Oliveira
Affiliations:
-;-
Venue:
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Year:
2002

Citing 10
Cited 4

A calculus of mobile processes, II

Information and Computation
Algebra of programming

Algebra of programming
Objects and classes, co-algebraically

Object orientation with parallelism and persistence
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency

Communication and Concurrency
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Final Universes of Processes

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A Typed Lambda Calculus with Categorical Type Constructors

Category Theory and Computer Science
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science

Configurations of Web Services

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Coordination Model for Interactive Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
An Exercise on Transition Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
A perspective on service orchestration

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the different ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model become clearly separated from the interaction structure which defines the synchronisation discipline. The approach is illustrated by the detailed development in CHARITY of an interpreter for a family of process languages.