Relating total and partial correctness interpretations of non-deterministic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Notions of computation and monads
Information and Computation
Theoretical Computer Science
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
Nondeterministic extensions of untyped &lgr;-calculus
Information and Computation
Filter models for conjunctive-disjunctive &lgr;-calculi
Theoretical Computer Science
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
ESOP '90 Proceedings of the 3rd European Symposium on Programming
May and Must Convergencey in Concurrent Lambda-Calculus
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Call-by-Value and Nondeterminism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On Semantic Foundations for Applicative Multiprogramming
Proceedings of the 10th Colloquium on Automata, Languages and Programming
FACILE: A Symmetric Integration of Concurrent and Functional Programming
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Concurrent ML: Design, Application and Semantics
Functional Programming, Concurrency, Simulation and Automated Reasoning: International Lecture Series 1991-1992, McMaster University, Hamilton, Ontario, Canada
The simple semantics for Coppe-Dezani-Sallé types
Proceedings of the 5th Colloquium on International Symposium on Programming
Powerdomains and nondeterministic recursive definitions
Proceedings of the 5th Colloquium on International Symposium on Programming
Applicative Information Systems
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
| Hi-index | 0.00 |
To model at the same time parallel and nondeterministic functional calculi we define a powerdomain functor &Rgr; such that it is an endofunctor over the category of algebraic lattices. &Rgr; is locally continuous and we study the initial solution D ∞ of the domain equation D = &Rgr;([D → D] ⊥). We derive from the algebras of &Rgr; the logic of D ∞, that is the axiomatic description of its compact elements. We then define a λ-calculus and a type assignment system using the logic of D ∞ as the related type theory. We prove that the filter model of this calculus, which is isomorphic to D ∞, is fully abstract with respect to the observational Preorder of the λ-calculus.