Chrysafis Hartonas, Matthew Hennessy  Home/Search
Context Related
| pinios.teilar.gr/pub/inco...CSL97.ps.gz 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: teilar.gr/~hartona...publications (more) Homepages: C.Hartonas |
Rate this article:      (best)Comment on this article |
Abstract: We study an applied typed call-by-value -calculus which in addition to the usual types for higher-order functions contains an extra type called proc, for processes. The constructors for terms of this type are similar to those found in standard process calculi such as CCS. We first give an operational semantics for this language in terms of a labelled transition system which is then used to give a behavioural preorder based on contexts: the expression N dominates M if in every appropriate... (Update)
Context of citations to this paper: More
...contexts that are translations of contexts in v , are never blocked by these operators. We consider here only value passing processes [2]. This means that if P : and V is any value that may occur as the object of a communication event during P s execution, then V is...
Cited by: More
A Minimal Calculus for Situated Multi-Agent Systems - Hartonas (2002) (Correct)
Dynamic Channel Screening in the Higher Order pi-Calculus - Vivas, Yoshida (Correct)
Similar documents (at the sentence level):
69.6%: Full Abstractness for a Functional/Concurrent Language With .. - Hartonas, Hennessy (1998) (Correct)
Active bibliography (related documents): More All
0.5: Denotational Semantics for a Higher-Order Extension of the.. - Hartonas (Correct)
0.3: Compositionality of Hennessy-Milner Logic - Through Structural Operational (Correct)
0.2: Towards a proposal for datatypes in E-LOTOS - Leduc, Pecheur, Garavel.. (1995) (Correct)
Similar documents based on text: More All
0.4: A Fixpoint Approach to Finite Delay and Fairness - Hartonas (1998) (Correct)
0.3: Duality for Modal µ-Logics - Hartonas (1998) (Correct)
0.2: Local Model Checking for Value-passing Processes (Extended.. - Rathke, Hennessy (Correct)
BibTeX entry: (Update)
Takis Hartonas and Matthew Hennessy. Full abstractness for a functional /concurrent language with higher-order value-passing. Journal of Functional Programming. http://citeseer.ist.psu.edu/hartonas98full.html More
@article{ hartonascsl97,
author = "Chrysafis Hartonas and Matthew Hennessy",
title = "Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract",
journal = "Proceedings CSL'97",
year = "1998",
url = "citeseer.ist.psu.edu/hartonas98full.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
306 LCF Considered as a Programming Language (context) - Plotkin - 1997
299 An Algebraic Theory of Processes (context) - Hennessy - 1988
210 its Syntax and Semantics (context) - Barendregt, -Calculus - 1984
159 CML: A Higher-Order Concurrent Language (context) - Reppy - 1991
146 A Powerdomain Construction (context) - Plotkin - 1976
119 FACILE: A symmetric integration of Concurrent and Functional.. (context) - Giacalone, Mishra et al. - 1989
118 Lambda-Calculus Models of Programming Languages (context) - Morris - 1968
87 Notions of Computation and Monads - Moggi - 1991
78 Modal Logics for Communicating Systems (context) - Stirling - 1987
75 Domain Theory in Logical Form (context) - Abramsky - 1991
67 Higher-Order Concurrency - Reppy - 1991
47 The Reflexive CHAM and the Join-Calculus - Fournet, Gonthier - 1994
46 Calculi for Higher-Order Communicating Systems (context) - Thomsen - 1990
35 Plain Chocs: A Second Generation Calculus for Higher Order P.. (context) - Thomsen - 1993
32 A Fully Abstract Denotational Model for Higher-Order Process.. (context) - Hennessy - 1994
30 Proof Systems for Satisfiability in Hennessy-Milner Logic wi.. (context) - Larsen - 1990
22 Translating Core Facile - Amadio - 1994
18 A Calculus of Mobile Processes I, II (context) - Milner, Parrow et al. - 1992
17 A Complete Proof System for SCCS with Modal Assertions (context) - Winskel - 1985
14 Call-by-Value and Nondeterminism (context) - Sieber - 1993
13 A Fully-Abstract Domain Model for the ß-Calculus (context) - Stark - 1996
12 A Fully Abstract Semantics for a Concurrent Functional Langu.. - Jeffrey - 1995
10 A Higher-Order Concurrent Language (context) - Reppy - 1991
8 A Filter Model and the Completeness of Type Assignment (context) - Barendregt, Coppo et al. - 1983
4 A Proof-Theoretic Characterization of Observational Equivale.. (context) - Stirling - 1985
3 Higher-Order Processes and their Models (context) - Hennessy
2 Handbook of Logic in Computer Science vol (context) - Abramsky, Gabbay et al. - 1994
2 Calculus for (Strict) Parallel Functions (context) - Boudol - 1994
2 Combining the Typed -Calculus with CCS (context) - Fereira, Hennessy et al. - 1996
Documents on the same site (http://www.teilar.gr/~hartonas/publications.html): More
Denotational Semantics for a Higher-Order Extension of the.. - Hartonas (Correct)
Full Abstractness for a Functional/Concurrent Language With .. - Hartonas, Hennessy (1998) (Correct)
Order-Duality, Negation and Lattice Representation - Hartonas (1996) (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