Must Preorder in Non-deterministic Untyped -calculus
نویسنده
چکیده
This paper studies the interplay between functional application and nondeterministic choice in the context of untyped -calculus. We introduce an operational semantics which is based on the idea of must preorder, coming from the theory of process algebras. To characterize this relation, we build a model using the classical inverse limit construction, and we prove it fully abstract using a generalization of Bohm trees.
منابع مشابه
How to Prove Similarity a Precongruence in Non-Deterministic Call-by-Need Lambda Calculi
Extending the method of Howe, we establish a large class of untyped higher-order calculi, in particular such with call-by-need evaluation, where similarity, also called applicative simulation, can be used as a proof tool for showing contextual preorder. The paper also demonstrates that Mann’s approach using an intermediate “approximation” calculus scales up well from a basic call-by-need non-de...
متن کاملNon deterministic extensions of untyped -calculus
The main concern of this paper is the study of the interplay between functionality and non determinism. Indeed the rst question we ask is whether the analysis of parallelism in terms of sequentiality and non determinism, which is usual in the algebraic treatment of concurrency, remains correct in presence of functional application and abstraction. We identify non determinism in the setting of -...
متن کاملReasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, case-expressions, seq, and recursive types. The typed language is a subset of the untyped language. Normal-order reduction is defined for the untyped language. Since there are less typed contexts the typed contextual pre...
متن کاملNon-deterministic Böhm trees
Lambda calculus is well established as the formal model of functional programming. Non-determinism is an interesting conceptual issue, often considered in process-calculi. It is interesting to mix lambda-calculus and non-determinism, firstly because programmers use functional programming but also concurrent methods, networks and multi-users systems, secondly as a step towards more complex langu...
متن کاملA Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
The paper proposes a variation of simulation for checking and proving contextual equivalence in a non-deterministic call-by-need lambda-calculus with constructors, case, seq, and a letrec with cyclic dependencies. It also proposes a novel method to prove its correctness. The calculus’ semantics is based on a small-step rewrite semantics and on may-convergence. The cyclic nature of letrec bindin...
متن کامل