See this document in CiteSeerX!

Constraints as Processes (1996)  (Make Corrections)  (15 citations)
Björn Victor, Joachim Parrow
International Conference on Concurrency Theory



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
daimi.aau.dk/~bra8130/LOM...SICS6.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  daimi.aau.dk/~b...OMAPS_abstracts (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . We present a compositional encoding of the fl-calculus into the ß-calculus. The former, used in the Oz semantics, is a recent small language with equational constraints over logical variables; the latter is a basic calculus of interacting processes. We establish a close correspondence between the reductions in the fl-calculus and its encoding, using weak barbed bisimulation congruence. 1 Introduction In this paper we shall relate two different strands in the semantics of programming... (Update)

Context of citations to this paper:   More

.... from logic programming languages into the # calculus [Ros93, Li94] and from concurrent constraint languages into the # calculus [Smo94, VP96]. The formalization of compilers for concurrent languages has also motivated the study of encodings, e.g. for Occam [Gam91] Facile...

...he identifies a common subcalculus of g and p and proves that it can embed the eager and the call by need l calculus. Victor and Parrow [40] give an embedding of the g calculus into the p calculus and prove its adequacy based on bisimulation semantics. Modalities for logic...

Cited by:   More
What is a `Good' Encoding of Guarded Choice? - Nestmann (1997)   (Correct)
Decoding Choice Encodings - Nestmann, Pierce (1996)   (Correct)
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001)   (Correct)

Active bibliography (related documents):   More   All
1.3:   Constraints as Processes - Victor, Parrow (1996)   (Correct)
0.6:   The Update Calculus (Extended Abstract) - Parrow, Victor (1997)   (Correct)
0.3:   The Weak Late pi-calculus Semantics as Observation.. - Ferrari, Montanari, Quaglia (1995)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.1:   The Tau-Laws of Fusion - Parrow, Victor   (Correct)
0.1:   Solos in Concert - Laneve, Victor (1999)   (Correct)
0.1:   The Fusion Calculus: Expressiveness and Symmetry in Mobile.. - Parrow, Victor (1997)   (Correct)

Related documents from co-citation:   More   All
11:   A foundation for higher-order concurrent constraint programming - Smolka - 1994
10:   Expressing Mobility (context) - Sangiorgi - 1993
10:   Barbed bisimulation - Milner, Sangiorgi - 1992

BibTeX entry:   (Update)

B. Victor and J. Parrow. Constraints as processes. In U. Montanari and V. Sassone, editors, CONCUR'96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 389--405. Springer-Verlag, 1996. http://citeseer.ist.psu.edu/article/victor96constraint.html   More

@inproceedings{ victor96constraints,
    author = "Bjorn Victor and Joachim Parrow",
    title = "Constraints as Processes",
    booktitle = "International Conference on Concurrency Theory",
    pages = "389-405",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/victor96constraint.html" }
Citations (may not include all citations):
1933   Communication and Concurrency (context) - Milner - 1989  ACM
297   A calculus of mobile processes (context) - Milner, Parrow et al. - 1992
248   Expressing Mobility (context) - Sangiorgi - 1992
197   Barbed bisimulation - Milner, Sangiorgi - 1992  ACM   DBLP
194   Functions as processes (context) - Milner - 1992  ACM   DBLP
55   Facile Antigua release -- programming guide (context) - Thomsen, Leth et al. - 1993
49   Model checking mobile processes - Dam - 1993  ACM   DBLP
46   Calculi for Higher Order Communicating Systems (context) - Thomsen - 1990
42   Algebraic theories for name-passing calculi - Parrow, Sangiorgi - 1995
41   A foundation for higher-order concurrent constraint programm.. - Smolka - 1994  ACM   DBLP
28   Constraints for free in concurrent computation - Niehren, Muller - 1995  ACM   DBLP
28   The definition of Kernel Oz - Smolka - 1995  ACM   DBLP
18   A typed higher-order programming language based on the pi-ca.. - Pierce, R'emy et al. - 1993
13   The Mobility Workbench --- a tool for the ß- calculus (context) - Victor, Moller - 1994
12   calculus specification of Prolog (context) - Li, ss- - 1994
7   Earlier version published as Report ECS-LFCS-93-270 (context) - Sangiorgi, of et al. - 1996
5   This article was processed using the L A T E X macro package.. (context) - Walker, the et al. - 1995
3   Towards a semantic-based verification environment for the pi.. - Ferrari, Modoni et al. - 1995
2   A partition refinement algorithm for the ß- calculus (context) - Pistore, Sangiorgi - 1996
2   To appear in the proceedings of FTRTFT'96 (context) - Amadio, Dam et al. - 1996
1   Available as ftp://ps-ftp (context) - Smolka, primer et al. - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.daimi.aau.dk/~bra8130/LOMAPS_abstracts.html):   More
Enhanced Operational Semantics - Degano, Priami (1996)   (Correct)
Clock Analysis of Synchronous Dataflow Programs - Jensen (1995)   (Correct)
Proving Properties of Dynamic Process Networks - Dam (1998)   (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