Categories, types, and structures: an introduction to category theory for the working computer scientist
Lambda-calculus, types and models
Lambda-calculus, types and models
Lambda-calculi for (strict) parallel functions
Information and Computation
Filter models for conjunctive-disjunctive &lgr;-calculi
Theoretical Computer Science
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Theoretical Computer Science - Modern algebra and its applications
Disjunctive Tautologies as Synchronisation Schemes
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Full Abstraction for Lambda Calculus with Resources and Convergence Testing
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
The lambda calculus is algebraic
Journal of Functional Programming
Information and Computation
Bidomains and full abstraction for countable nondeterminism
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Modelling Local Variables: Possible Worlds and Object Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
| Hi-index | 0.00 |
We recently introduced an extensional model of the pureλ -calculus living in a canonical cartesian closedcategory of sets and relations [6]. In the present paper, we studythe non-deterministic features of this model. Unlike mosttraditional approaches, our way of interpreting non-determinismdoes not require any additional powerdomain construction. We showthat our model provides a straightforward semantics ofnon-determinism (may convergence) by means ofunions of interpretations, as well as ofparallelism (must convergence) by means of abinary, non-idempotent operation available on the model, which isrelated to the mix rule of Linear Logic. More precisely,we introduce a λ -calculus extended withnon-deterministic choice and parallel composition, and we defineits operational semantics (based on the may andmust intuitions underlying our two additional operations).We describe the interpretation of this calculus in our model andshow that this interpretation is sensible with respect to ouroperational semantics: a term converges if, and only if, it has anon-empty interpretation.