Plotkin, G., Call-by-name, call-by-value and the lambda-calculus, TCS, 1:125--159, 1975. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Categorical and Graphical Models of Programming Languages - Schweimeier (2001) (1 citation) (Correct)
....based on the lambda calculus, one does not usually admit the rule (b) in all contexts. Instead, a reduction strategy is defined, which chooses an instance of the lefthand side of (b) called a redex) in any lambda term. The most common reduction strategies are call by value and call by name [Plo75]. In call by value, the left most redex (lx:M)N is chosen, but before this redex is reduced, reduction is performed in N, until N is reduced to a value v a variable or an abstraction, and then (b) is used to reduce (lx:M)v. In call by name, the left most redex (lx:M)N is chosen, and ....
....with operations for creating, reading, and updating integer reference cells, i.e. a fragment of the programming language ML [MTH90] called Reduced ML . An operational semantics for the n calculus is defined by a big step evaluation relation, similar to the call by value lambda calculus [Plo75], taking into account the newly created names; an alternative small step semantics is given as a reduction relation, and it is shown that small step and big step semantics are equivalent. Operational equivalence is defined as contextual equivalence, i.e. two programs are operationally equivalent ....
G. D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1, 1975.
Diagrams for Meaning Preservation - Wells Detlef Plump (2003) (Correct)
....generic support for using developments in combination with any method. 1 Discussion 1.1 Background and Motivation A programming language is defined as a set of programs and a way to evaluate (or execute ) the programs. It is increasingly popular to define evaluation via program rewriting [25, 9, 10, 11, 3, 19, 12, 26]. In this approach, evaluation rewrite rules are repeatedly applied at particular program positions which are typically specified using evaluation contexts [9] Other kinds of program rewriting than evaluation are also desirable. Potential uses of rewriting based program transformations include ....
....program s meaning as given by evaluation. There are many non rewriting based approaches, such as denotational semantics (models) logical relations, applicative bisimulation and coinduction, etc. but they will not be discussed here because this paper focuses on rewriting based techniques. Plotkin [25] first devised a rewriting based method to prove meaning preservation for the call by name and call by value # calculus using confluence and standardization. At the same time, Plotkin proved that evaluation via rewriting was equivalent to evaluation via abstract machine. Subsequently, this ....
[Article contains additional citation context not shown here]
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1, 1975.
On The Type Structure of Standard ML - Robert Harper Carnegie-Mellon (1993) (29 citations) (Correct)
....then (x.0) diverges in the current call by value implementation, but (x.0) 0 is provable using the usual h calculus style reasoning. It would be interesting to explore a typed calculus that is faithful to the operational semantics, following the pattern established by Plotkin s v Calculus [51] and Martin LSf s type theory [32] Some useful related ideas are developed in Moggi [49] ACKNOWLEDGMENTS Thanks to Dave MacQueen for many insightful discussions of ML, and comments on this paper in particular. Thanks also to John Greiner, Peter Lee, Eugenio Moggi, and Andrzej Tarlecki for ....
PLOTKIN, G.D. Call-by-name, call-by-value and the lambda calculus. Theor. Cornput. Sc. 1 (1975), 125-159.
A Partial Evaluator for the Untyped Lambda Calculus - Gomard, Jones (1991) (93 citations) (Correct)
....evaluation of a lambda expression p it is tempting to insert the partial input data in p, and apply one of the usual reduction strategies, modi ed not to reduce when insucient information is available. But the standard call by name and call by value reduction strategies (for example as de ned in [Plotkin 1975]) do not reduce inside the bodies of abstractions. This approach yields trivial results in practice. It is no solution either to reduce indiscriminately inside abstractions since this can lead to in nite reduction if the expression contains a xed point operator, or the Y combinator written as a ....
G. Plotkin, Call-by-name, Call-by-value and the lambda calculus, Theoretical Computer Science 1 (1975) 125-159.
Sober Spaces And Continuations - Taylor (2002) (Correct)
....the # and # rules are equations between di#erent notations for the same value, and are applicable at any depth within a # expression. This is in contrast to the way in which # calculi are made to agree with the execution of programming languages, by restricting the applicability of the # rule [Plo75]. Besides defining call by name and call by value reduction strategies, this paper used continuations to interpret one dually within the other. 2.3. Notation. We take account of the restriction on type formation by adopting a convention for variable names: lower case Greek letters and capital ....
Gordon Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125--159, 1975.
Games Characterizing Levy-Longo Trees - Ong, Di Gianantonio (Correct)
....universal model of Levy Longo trees i.e. every strategy is the denotation of a unique Levy Longo tree. To our knowledge, this is the rst universal model of Levy Longo trees. The observational quotient of the model then gives a universal and fully abstract model of the pure Lazy Lambda Calculus [15, 3]. Related work. Universal models for the Lazy Lambda Calculus with convergence test were rst presented in [2] and [13] The model studied in the former is in the AJM style [1] while that in the latter, by McCusker, is based on an innocent strategy [8] universal model for call by name FPC, and ....
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.
Assigning Types to Processes - Yoshida, Hennessy (2000) (32 citations) (Correct)
....exchanged along communication channels [3, 41, 50] We believe that our typing system can be readily adapted to related location based distributed calculi such as those in [6, 12, 28, 17, 40, 47] Higher Order Processes. The language we consider, lp v , is essentially a call byvalue l calculus [39] augmented with the p calculus primitives [33] Values may be sent and received along communication channels, as in the p calculus, but functions may also be applied to them, as in the l calculus. Thus c (x : t) f x (1) is a process which inputs a value of type t on channel c and applies to it ....
Plotkin, G., Call-by-name, call-by-value and the lambda-calculus, TCS, 1:125--159, 1975.
Computational Interpretations of Linear Logic - Abramsky (1993) (225 citations) (Correct)
....an evaluation strategy, and hence an operational semantics. The proof system in itself does not enforce a strategy on us. This is not too surprising, since extensional differences between these strategies only show up in the calculus in the presence of non terminating programs (see e.g. [Plo75]) and under the strict correspondence of typed programs with proofs, we have Strong Normalization, so that all programs and indeed all strategies terminate. However, it is one of the most notable features of Linear Logic that a clear perspective on Lazy vs. Eager Evaluation is provided ....
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical
Actor Languages: Their Syntax, Semantics, Translation, and.. - Mason, Talcott (Correct)
....to define the reaction rules. To do this we decompose each non value expression as a reduction context filled with a redex. Reduction contexts identify the subexpression of an expression that is to be evaluated next, they correspond to the standard reduction strategy (left first, call by value) of [Plo75] and were first introduced in [FF86] An expression e is either a value or it can be decomposed uniquely into a reduction context filled with a redex. Thus, local actor computation is deterministic. Definition (V E rdx R) The set of values, V, the set of redexes, E rdx , and the set of reduction ....
G. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125-- 159, 1975.
Duality between Call-by-Name Recursion and Call-by-Value Iteration - Kakutani (2001) (Correct)
....return type of continuations. A continuation of type A is a computation from A to R. While intuitively a value means the result of a computation in a point, a continuation means the rest of a computation in a point. A typical example of continuation usage is continuation passing style (e.g. see [22]) In the continuation semantics, we can consider f : A B transforms a continuation g of B to a continuation g f of A. This implies that the exchange of value paradigm for continuation paradigm makes the directions of computations reverse. The duality between call by name and call by value is ....
....x 1 : B 1 ; xn : Bn M : A j 1 : A 1 ; m : Am is translated to the judgement x 1 : VB1 ; xn : VBn ; 1 : KA1 ; m : KAm f M : CA . The call by name CPS translation is based on that of Hofmann and Streicher [14] rather than Plotkin s original translation [22], and the call by value CPS translation is essentially the same on terms as Plotkin s [22] In the same Call by name Recursion and Call by value Iteration vii V V 1 VA B VA VB VA B VA KB R V 0 VA B VA VB KA VA R CA KA R e x = k KA : k x x : A e = k K ....
[Article contains additional citation context not shown here]
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) Self-citation (Plotkin) (Correct)
No context found.
Gordon D. Plotkin, Call-by-Name, Call-by-Value and the Lambda-Calculus, TCS, Vol. 1, No. 2, pp. 125-159, 1975.
Assigning Types to Processes - Yoshida, Hennessy (2000) (32 citations) (Correct)
No context found.
Plotkin, G., Call-by-name, call-by-value and the lambda-calculus, TCS, 1:125--159, 1975.
Closed Types as a Simple Approach to Safe Imperative.. - Calcagno, Moggi, Taha (2000) (4 citations) (Correct)
No context found.
Gordon D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1:125--159, 1975.
Security and Fault-Tolerance in Distributed Systems: An - Actor-Based Approach Gul (Correct)
No context found.
G. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125{ 159, 1975.
Termination Analysis of the Untyped -Calculus - Neil Jones And (Correct)
No context found.
G.D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1, 1975. 18
Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000) (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125--159, 1975.
On the Observable Properties of - Higher Order Functions (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical computer Science 1(1975) 125--159.
Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (2 citations) (Correct)
No context found.
G. D. Plotkin, Call-by-name, call-by-value and the lambda calculus, Theoret. Comput. Sci. 1 (1975) 125159.
Process Logic and Duality - Part I: Sequential Processes - Honda (Correct)
No context found.
Plotkin, G., Call-by-name, Call-by-value and the lambda-calculus, TCS, 1:125-159, 1975.
Observable Properties of Higher Order Functions - That Dynamically Create (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical computer Science 1(1975) 125--159.
A Compositional Logic for Polymorphic Higher-Order Functions - Kohei Honda Department (2004) (Correct)
No context found.
Plotkin, G., Call-by-name, Call-by-value and the lambda-calculus, TCS, 1:125--159, 1975.
A Calculus for Link-time Compilation - Machkasova, Turbak (2000) (23 citations) (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theor. Comp. Sc., 1:125--159, 1975.
Diagrams for Meaning Preservation - Wells Detlef Plump (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1, 1975.
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1:125--159, 1975.
Diagrams for Meaning Preservation - Wells Detlef Plump (2003) (Correct)
No context found.
G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1, 1975.
First 50 documents Next 50
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