Dale Miller  Home/Search
Context
Related
Links: ACM | upenn.edu/pub/papers/miller/pic.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~iliano/linear...llb (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The agent expressions of the ß-calculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of ß-calculus (unlabeled) reduction is identified with "entailed-by". Under this translation, parallel composition is mapped to the multiplicative disjunct ("par") and restriction is mapped to universal quantification. Prefixing, non-deterministic choice ( ), replication (!), and the match guard are all represented using non-logical constants, which... (Update)
Similar documents (at the sentence level):
50.4%: The pi-Calculus as a Theory in Linear Logic: Preliminary Results - Miller (1992) (Correct)
Active bibliography (related documents): More All
0.2: Sequent Calculus and the Specification of Computation - Lecture.. - Miller (1998) (Correct)
0.2: Forum: A Multiple-Conclusion Specification Logic - Miller (1996) (Correct)
0.2: A Language for the Logical Specification of Processes and Relations - Caires (1996) (Correct)
Similar documents based on text: More All
0.1: An Introduction to Natural Language Generation - Dale (1995) (Correct)
0.1: Upper bounds for the solution of the discrete algebraic.. - Tippett, Marchesin (1999) (Correct)
0.1: Metric-Based Methods for Adaptive Model Selection and.. - Schuurmans, Southey (2001) (Correct)
BibTeX entry: (Update)
@inproceedings{ miller92welp,
Author="Dale Miller",
Title="The $\pi$-calculus as a theory in linear logic: Preliminary
results",
Booktitle="Proceedings of the 1992 Workshop on Extensions to Logic
Programming",
Editor = "E. Lamma and P. Mello",
Publisher = "Springer-Verlag",
Series = "LNCS",
Number = "660",
Pages="242-265",
Year=1993,
URL = "citeseer.ist.psu.edu/miller92picalculus.html",
URL = "file://ftp.cis.upenn.edu/pub/papers/miller/pic.ps.Z" }
Citations (may not include all citations):340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
297 A calculus of mobile processes (context) - Milner, Parrow et al. - 1989
297 A calculus of mobile processes (context) - Milner, Parrow et al. - 1989
233 Computational interpretations of linear logic - Abramsky - 1990 ACM DBLP
223 Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1991 ACM
215 Theoretical Computer Science (context) - Girard - 1987 ACM
194 Functions as processes (context) - Milner - 1990 ACM DBLP
149 A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
50 Higher-order Horn clauses - Nadathur, Miller - 1990 ACM DBLP
42 Modal logics for mobile processes - Milner, Parrow et al. - 1991 ACM DBLP
39 Algebraic Theory of Processes (context) - Hennessy - 1988 ACM
35 Observation equivalence as a testing equivalence (context) - Abramsky - 1987 ACM DBLP
32 Normalization as a homomorphic image of cut-elimination (context) - Pottinger - 1977
20 Abstract syntax and logic programming (context) - Miller - 1992 ACM DBLP
17 Proofs as processes (context) - Abramsky - 1991 ACM DBLP
4 Permutabilities of inferences in gentzen's calculi LK and LJ (context) - Kleene - 1952
4 LFCS Report Series ECS-LFCS (context) - Milner, ss-calculus et al. - 1991
Documents on the same site (http://theory.stanford.edu/~iliano/linearbib/llb.html): More
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
The Undecidability Of Second Order Linear Logic Without.. - Lafont (1995) (Correct)
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997) (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