Results 1 
4 of
4
Filter Models for ConjunctiveDisjunctive λcalculi
, 1996
"... The distinction between the conjunctive nature of nondeterminism as opposed to the disjunctive character of parallelism constitutes the motivation and the starting point of the present work. λcalculus is extended with both a nondeterministic choice and a parallel operator; a notion of reduction i ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
The distinction between the conjunctive nature of nondeterminism as opposed to the disjunctive character of parallelism constitutes the motivation and the starting point of the present work. λcalculus is extended with both a nondeterministic choice and a parallel operator; a notion of reduction is introduced, extending fireduction of the classical calculus. We study type assignment systems for this calculus, together with a denotational semantics which is initially defined constructing a set semimodel via simple types. We enrich the type system with intersection and union types, dually reflecting the disjunctive and conjunctive behaviour of the operators, and we build a filter model. The theory of this model is compared both with a Morrisstyle operational semantics and with a semantics based on a notion of capabilities.
A Filter Model for Concurrent λCalculus
 SIAM J. Comput
, 1998
"... Type free lazy calculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union typ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Type free lazy calculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types and we prove that the induced logical semantics is fully abstract.
Principal Typing for Parallel and nonDeterministic lambdacalculus
, 1997
"... Parallelism and nondeterminism are fundamental concepts in the process algebra theory. Combining them with calculus can enlighten the theory of higherorder process algebras. In recent papers an analysis of a calculus containing parallel and nondeterministic operators was carried on by means of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Parallelism and nondeterminism are fundamental concepts in the process algebra theory. Combining them with calculus can enlighten the theory of higherorder process algebras. In recent papers an analysis of a calculus containing parallel and nondeterministic operators was carried on by means of a type assignment system with intersection and union types. The present paper answers the problem of determining principal types for this system. For correspondence contact Franco Barbanera Dipartimento di Informatica, Universit'a di Torino Corso Svizzera 185, 10149 Torino Italy email: barba@di.unito.it tel: +39 11 7429111 Fax: +39 11 751603 1 Principal Typing for Parallel and nonDeterministic calculus Abstract Parallelism and nondeterminism are fundamental concepts in the process algebra theory. Combining them with calculus can enlighten the theory of higherorder process algebras. In recent papers an analysis of a calculus containing parallel and nondeterministic operators ...
Nondeterministic Linear Logic
, 2004
"... In this paper, we introduce Linear Logic with a nondeterministic facility, which has a selfdual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the system is expressed by the process of normalization, not by pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we introduce Linear Logic with a nondeterministic facility, which has a selfdual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the system is expressed by the process of normalization, not by proof search. Moreover we can incorporate the system into Light Linear Logic and Elementary Linear Logic developed by J.Y.Girard recently: Nondeterministic Light Linear Logic and Nondeterministic Elementary Linear Logic are defined in a very natural way. 1