Entry Raja:1997:CFC from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Raja:1997:CFC,
  author =       "N. Raja and R. K. Shyamasundar",
  title =        "Combinatory formulations of concurrent languages",
  journal =      j-TOPLAS,
  volume =       "19",
  number =       "6",
  pages =        "899--915",
  month =        nov,
  year =         "1997",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Mar 11 18:11:48 MST 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/toplas/1997-19-6/p899-raja/",
  abstract =     "We design a system with six {\em Basic Combinators\/}
                 and prove that it is powerful enough to embed the full
                 asynchronous $\pi$-calculus, including replication. Our
                 theory for constructing {\em Combinatory Versions\/} of
                 concurrent languages is based on a method, used by
                 Quine and Bernays, for the general elimination of
                 variables in linguistic formalisms. Our combinators are
                 designed to eliminate the requirement of {\em names\/}
                 that are {\em bound\/} by an{\em input prefix}. They
                 also eliminate the need for input prefix, output
                 prefix, and the accompanying mechanism of {\em
                 substitution}. We define a notion of {\em
                 bisimulation\/} for the combinatory version and show
                 that the combinatory version preserves the semantics of
                 the original calculus. One of the distinctive features
                 of the approach is that it can be used to rework
                 several process algebras in order to derive equivalent
                 combinatory versions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Lambda
                 calculus and related systems. {\bf I.1.3} Computing
                 Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
                 Languages and Systems, Substitution mechanisms**. {\bf
                 F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation, Parallelism and
                 concurrency.",
}

Related entries