K. Sharma, Syntactic Aspects of the Non-deterministic Lambda Calculus, Master's thesis, Washington State University, September 1984. Available as internal report CS-84-127 of the Comp. Sci Dept.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....approach to find correct calculi w.r.t. an operational equivalence, was first considered in [Plo75] for call by value and call by name operational equivalence. This approach was later extended, following a similar methodology, to consider other features of computations like nondeterminism (see [Sha84]) and sideeffects (see [FFKD86, MT89] The calculi based only on operational considerations, like the v calculus, are sound and complete w.r.t. the operational semantics, i.e. a program M has a value according to the operational semantics iff it is provably equivalent to a value (not ....

K. Sharma. Syntactic aspects of the non-deterministic lambda calculus. Master's thesis, Washington State University, September 1984. available as internal report CS-84-127 of the comp. sci. dept.

....approach to nd correct calculi w.r.t. an operational equivalence, was rst considered in [Plo75] for call by value and call by name operational equivalence. This approach was later extended, following a similar methodology, to consider other features of computations like nondeterminism (see [Sha84]) and sidee ects (see [FFKD86, MT89] The calculi based only on operational considerations, like the v calculus, are sound and complete w.r.t. the operational semantics, i.e. a program M has a value according to the operational semantics i it is provably equivalent to a value (not ....

K. Sharma. Syntactic aspects of the non-deterministic lambda calculus. Master's thesis, Washington State University, September 1984. available as internal report CS-84-127 of the comp. sci. dept.

....approach to nd correct calculi w.r.t. an operational equivalence, was rst considered in [Plo75] for call by value and call by name operational equivalence. This approach was later extended, following a similar methodology, to consider other features of computations like nondeterminism (see [Sha84]) side e ects and continuations (see [FFKD86, FF89] The calculi based only on operational considerations, like the v calculus, are sound and complete w.r.t. the operational semantics, i.e. a program M has a value according to the operational semantics i it is provably equivalent to a value ....

K. Sharma. Syntactic aspects of the non-deterministic lambda calculus. Master's thesis, Washington State University, September 1984. available as internal report CS-84-127 of the comp. sci. dept.

....assume familiarity with Plotkin s paper. 2 The Language The language is the usual untyped calculus extended with the choice operation , so a term can be: a variable x, an abstraction x:M , an application MN , or a binary sum M N . Sharma and de Liguoro studied this language in their theses [Sha84, dL92], obtaining interesting results about its operational and denotational semantics. The basic reduction relation fi is axiomatized by a set of rules that contains the expected rules from [Plo92] in particular the fi rule: x:M)N fi [N=x]M The novelties are the rules for choice: M N fi ....

....for type inference too. Thus, we have soundness and completeness results for the models of reduction that satisfy (3) Note that the analogous condition for M(N N 0 ) and (MN) MN 0 ) is not sensible, since these two terms behave differently (at least for some calling mechanisms; see [Sha84]) And the condition for (M M 0 )N and (MN) M 0 N) would not work, since although these two terms behave identically the latter can be easier to type. For example, if the environment Gamma contains x : s s) ff and y : t t) ff for s and t different type variables and ff any type ....

Keshav Sharma. Syntactic aspects of the non-deterministic lambda calculus. Technical Report CS-84-127, Washington State University, September 1984. Thesis. See also the references in [Plo92] and [dL92].

No context found.

K. Sharma, Syntactic Aspects of the Non-deterministic Lambda Calculus, Master's thesis, Washington State University, September 1984. Available as internal report CS-84-127 of the Comp. Sci Dept.

No context found.

K. Sharma, Syntactic Aspects of the Non-deterministic Lambda Calculus, Master's thesis, Washington State University, September 1984. Available as internal report CS-84-127 of the Comp. Sci Dept.

No context found.

K. Sharma, Syntactic Aspects of the Non-deterministic Lambda Calculus, Master's thesis, Washington State University, September 1984. Available as internal report CS-84-127 of the Comp. Sci Dept. 65

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC