(Enter summary)
Abstract: We present a generic model of the -calculus based on a new mathematical
structure called -forests. We present a small theory of the
static properties of -forests, with a short study of homomorphisms.
We then present the dynamic aspects of the model by encoding the
-calculus. Finally we consider an example using the model, which
uses a general -calculus result that relates languages with process
constants with languages with replication.
Acknowledgments
I would like to thank my... (Update)
Active bibliography (related documents): More All
0.5: Solving Open Questions and Other Challenge Problems Using Proof.. - Veroff (2001)
(Correct)
0.3: Using Operational Intuition about Events and Causality in.. - Chou (1995)
(Correct)
0.3: Algebraic Verification of a Distributed Summation Algorithm - Groote, Springintveld (1996)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Coalescent Random Forests - Pitman (1998)
(Correct)
0.1: Causes of mite pest outbreaks in bamboo forests in.. - Zhang, Zhang, Tong.. (2000)
(Correct)
0.1: An Old-Growth Definition for Eastern Riverfront Forests - Meadows, Nowacki
(Correct)
BibTeX entry: (Update)
@misc{ tang-generic,
author = "Francis Tang",
title = "A Generic Model of the Pi Calculus.",
url = "citeseer.ist.psu.edu/tang98generic.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1984 ACM DBLP
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
293
Programming from Specifications (context) - Morgan - 1994 ACM
232
Category Theory for Computing Science (context) - Barr, Wells - 1996 ACM
195
The Theory and Practice of Concurrency (context) - Roscoe - 1998
76
The Polyadic -Calculus: a Tutorial
- Milner - 1992
61
The Fusion Calculus: Expressiveness and Symmetry in Mobile P..
- Parrow, Victor - 1998 DBLP
58
Naive Set Theory (context) - Halmos - 1960
42
Lecture Notes in Computer Science (context) - Philippou, Walker et al. - 1997
38
Computability: An Introduction to Recursive Function Theory (context) - Cutland - 1980
31
Elements of Set Theory (context) - Enderton - 1977
8
Lecture Notes in Computer Science (context) - Cardelli, Gordon et al. - 1998
3
Verification of a Distributed Summation Algorithm
- Vaandrager - 1995 ACM DBLP
2
Lecture Notes in Computer Science (context) - Nestmann, Pierce et al. - 1996
Documents on the same site (http://www2.dcs.ed.ac.uk/home/fhlt/Research/):
Thesis Proposal: Formal Verification Of Program Correctness For.. - Tang
(Correct)
Higher-Order Embeddings of Program Logics - Tang (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC