Download:
|
by Takis Hartonas, Matthew Hennessy
ftp://pinios.teilar.gr/pub/incoming/hartonas/H/Facile.ps.gz
Add To MetaCart
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 context if M can produce a boolean value then so can N. Based on standard domain constructors we define a model, a prime algebraic lattice, which is fully abstract with respect to this behaviour preorder; expressions are related in the model if and only if they are related behaviourally. The proof method uses concepts which are of independent interest. It involves characterising the domain using filters of a property logic for program expressions and developing a program logic for relating program expressions with property formulae. 1
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
894
|
The lambda calculus, its syntax and semantics
– Barendregt
- 1984
|
|
565
|
Notions of computation and monads
– Moggi
- 1991
|
|
363
|
Algebraic Theory of Processes
– Hennessy
- 1988
|
|
332
|
D.: LCF considered as a programming language
– Plotkin
- 1977
|
|
216
|
CML: A Higher-order Concurrent Language
– Reppy
- 1991
|
|
186
|
Domain theory in logical form
– Abramsky
- 1987
|
|
168
|
A powerdomain construction
– Plotkin
- 1976
|
|
135
|
A Calculus of Mobile
– Milner, Parrow, et al.
- 1992
|
|
126
|
Lambda-Calculus Models of Programming Languages
– Morris
- 1968
|
|
125
|
FACILE, a symmetric integration of concurrent and functional programming
– Giacalone, Mishra, et al.
- 1989
|
|
119
|
Higher-order concurrency
– Reppy
- 1992
|
|
47
|
A fully abstract denotational model for higher-order processes
– Hennessy
- 1994
|
|
35
|
CHOCS: A second generation calculus for higher order processes
– Thomsen, Plain
- 1993
|
|
28
|
Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion
– LARSEN
- 1990
|
|
27
|
A calculus of higher-order communicating systems
– Thomsen
|
|
25
|
A Lambda Calculus for (Strict) Parallel Functions
– Boudol
- 1994
|
|
23
|
Translating Core Facile
– Amadio
- 1994
|
|
16
|
A complete proof system for SCCS with modal assertions
– Winskel
- 1986
|
|
15
|
A fully abstract semantics for a concurrent functional language with monadic types
– Jeffrey
- 1995
|
|
10
|
A filter model and the completeness of type assignment
– Barendregt, Coppo, et al.
- 1983
|
|
9
|
Call-by-Value and Nondeterminism
– Sieber
- 1993
|
|
6
|
The Reflexive
– Fournet, Gonthier
- 1996
|
|
5
|
Combining the Typed -Calculus with CCS
– Fereira, Hennessy, et al.
- 1996
|
|
4
|
A Fully-Abstract Domain Model for the -Calculus
– Stark
- 1996
|
|
4
|
A proof-theoretic characterization of observational equivalence
– Stirling
- 1985
|
|
3
|
Higher-Order Processes and their Models", ICALP '94
– Hennessy
|
|
2
|
Gabbay and T.S.E.Maibaum, (eds) Handbook of Logic
– Abramsky, M
- 1994
|
|
2
|
Modal Logics for Communicating Systems", Theoretical Computer Science vol 49
– Stirling
- 1987
|
