M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....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 ....

....and standardization. At the same time, Plotkin proved that evaluation via rewriting was equivalent to evaluation via abstract machine. Subsequently, this approach has been applied to many systems, including systems with imperative features such as assignments and continuations (examples include [10, 11, 21, 3, 19, 12, 26, 17]) Warning 1.1 (Not Quite Same as Observational Equivalence) What we call meaning preservation is related to observational equivalence (sometimes called observational soundness [18] operational equivalence, consistency [25] etc. but is only the same for contextually closed rewriting systems. ....

M. Felleisen, D. P. Friedman. A syntactic theory of sequential state. Theoret. Comput. Sci., 69(3), 1989.

....application of monads to computation, Moggi seems [Mo89] to have been motivated by an interest in handling impure forms of computation in the framework of the calculus. Work in the late 1980s had directly constructed variants of calculus to handle various particular impure facilities (e.g. [FeFr89]) Moggi, however, followed the principle that category theory is prior to calculus (because category theory is a generalization of the set based function theory on which calculus is founded) therefore, he reasoned, natural generalizations of the foundations of calculus ought to be cleanly ....

Matthias Felleisen and Daniel P. Friedman, \A Syntactic Theory of Sequential State", Theoretical Computer Science 69 no. 3 (18 December 1989), pp. 243-287.

....can be awkward. Indeed, one is faced with non well founded relations which prevent proofs by induction. Observe that graphs di er from trees in that the latter naturally support de nition and proof by structural induction) In this paper we will annotate terms (trees) with global addresses [FF89, Ros96] Levy [L ev80] and Maranget [Mar92] propose using local addresses, but from the point of view of the operational semantics, global addresses describe better what is going in a computer or an abstract machine. With explicit global addresses we can keep track of the sharing that could be ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243-287, 1989.

....unfolding until needed. The trick is to augment the explicit horizontal sharing that we have introduced in 27 previous sections through addresses with explicit vertical sharing (using the terminology of Ariola Klop 1994) We have chosen to do this using the ffl a backpointer syntax (Felleisen Friedman 1989, Rose 1996) reducing a fixed point operator places a ffl at the location where unfolding should happen when (if) it is needed. The difference is illustrated by Fig. 7. Consider the initial term with a Figure 7: A recursive redex occurrence. large (shaded) redex containing a smaller (white) ....

Felleisen, M. & Friedman, D. P. (1989), `A syntactic theory of sequential state', Theor. Comp. Sci. 69, 243--287.

....a semantics of partial evaluation (by augmenting the operational semantics by oriented instances of the full logic) Equational logics are also particularly amenable to mechanical implementation. Unlike work on calculi for reasoning about imperative features in otherwise functional languages [11, 25, 24], PIM has a particular affinity for constructs in Algol class (as opposed to Lisp like) languages, since it does not rely on the use of lambda expressions or monads to sequence assignments. This permits the use of stronger axioms for reasoning about storespecific sequencing. Yang, Horwitz, and ....

FELLEISEN, M., AND FRIEDMAN, D. P. A syntactic theory of sequential state. Theoretical Computer Science 69 (1989), 243--287.

....[GKS89] from which TGRS emerges but it was never achieved. Similarly, AK96] conclude their de nition of Equational Term Graph Rewriting by Furthermore, we intend to study the suitability of equational graph rewriting for expressing side e ect operations . Mutation was, however, handled by [FF89] by introducing (what we call) addresses, to cite: we incorporate the store into the program component of the machine . This approach as well as the later addressed explicit rewriting [Ros96b] su er from having a very low level notion of reduction which thus makes generic algebraic reasoning ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243287, 1989.

....semantics and the rewriting system. A proof of standardization is one way to do this. 2. The existing theoretical tools for the above task have proven dicult to use. In practice, standardization proofs have been carefully hand crafted for equational calculi intended for program reasoning [FF89, FH92, Mul92, AF97]. When proving standardization for a new language, it is a laborious task to adapt an existing proof to the new language. There are some general purpose tools from the rewriting community, but the programming language theorist has problems using them for various reasons: a) Some methods are too ....

.... something they call abstract standardization [KG96] and what they call relative standardization [GK] Standardization has been used extensively for validating the consistency of an operational semantics with a calculus by Plotkin, Felleisen, Ariola, Friedman, Hieb, Muller, and others not listed [Plo75, FF89, FH92, Mul92, AF97]. The method of Ariola and Felleisen depends on disjoint redexes having disjoint residuals. Higher order term rewriting has been presented in a number of di erent formalisms, including several variations on the format of CRS s [Klo80, Nip91, KvO95, Ken89, vR96, vO94, KvOvR93, Kha90, Tak93, Wol93] ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theor. Comp. Sc., 69(3):243-287, 1989.

....M with N when equation M = N is in the theory. In order to use this general approach, one must de ne both an operational semantics of a programming language and a calculus of fragments and then establish the appropriate connection between them. In [Plo75] and many subsequent studies (e.g. [FF89, FH92, Mul92]) the operational semantics and calculus are de ned independently and then connected via a standardization theorem for the calculus. More recently (e.g. AF97] it is common to start with the calculus, prove a standardization theorem for it and then simply de ne the operational semantics as a ....

....for the calculus. In either approach, a standardization theorem for the calculus is required. Unfortunately, the usual approach to proving standardization for calculi intended for program reasoning is somewhat unsatisfying. In practice, such proofs have been hand crafted for each calculus (e.g. [FF89, FH92, Mul92, AF97]) The usually ad hoc nature of such proofs means that proving standardization for a new language is a laborious and error prone task of adapting an existing proof to the new language. The Corresponding author. Voice: 1 617 552 3964. Fax: 1 617 552 2097. E mail: muller cs.bc.edu. This ....

[Article contains additional citation context not shown here]

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theor. Comp. Sc., 69(3):243-287, 1989.

....can be awkward. Indeed, one is faced with non wellfounded relations which prevent proofs by induction. Observe that graphs di er from trees in that the former naturally support de nition and proof by structural induction) In this paper we will annotate terms (trees) with global addresses 1 , FF89, Ros96] With explicit addresses we can keep track of the sharing that could be used in the implementation of a particular calculus of explicit substitution. Sub terms which share a common address represent the same sub graphs, as suggested in Figure 1 (where a and b denote addresses) A speci ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243-287, 1989.

....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 (not necessarily the same) in the calculus, but they ....

M. Felleisen and D.P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69(3), 1989.

....instances of the full logic) Equational logics are also particularly amenable to mechanical implementation, using such techniques as graph rewriting [4] unification, and equational unification. ffl Unlike work on calculi for reasoning about imperative features in otherwise functional languages [16, 40, 39], PIM has a particular affinity for constructs in Algol class (as opposed to Lisp like) languages, since it does not rely on the use of lambda expressions or monads to sequence assignments. This permits the use of stronger axioms for reasoning about store specific sequencing. ffl Yang, Horwitz, ....

FELLEISEN, M., AND FRIEDMAN, D. P. A syntactic theory of sequential state. Theoretical Computer Science 69 (1989), 243--287.

....Carolyn Talcott (Mason and Talcott, 1991a) Matthias Felleisen and Robert Hieb (Felleisen and Hieb, 1992) As well as being conceptually elegant, it has also provided the necessary tools for several key results and proofs. It provided the basis for an elegant revision of (Felleisen, 1987; Felleisen and Friedman, 1989) that was later published in (Felleisen and Hieb, 1992) Other notable successful uses of the technique is the type soundness proof, via subject reduction, of the imperative ML type system (Felleisen and Wright, 1991) The analysis of parameter passing in Algol (Crank and Felleisen, 1991; Weeks ....

Felleisen, M. and Friedman, D. P. (1989). A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287.

....compilers do) even though such reductions may not occur during execution. The novelty of S lies in the way it treats side effects and barriers. In the functional programming literature, introduction of side effects is usually in the context of a sequential operational semantics (see, for example, [12] and [16] for call by value languages, or state monads in Haskell [15] and state is often modeled by a single global store with sequential operations. S , on the other hand, introduces no such sequentialization, nor a separate store. The store is distributed throughout the term and we give ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989.

.... and to a lesser extent for the case of languages Supported by UK SERC grant GR G53279 and CEC ESPRIT project CLICS II Supported by UK SERC studentship 91307943 and CEC SCIENCE project PL910296 involving the dynamic creation of mutable locations (such as ML style references) See [17, 2, 7, 3, 18, 12, 13, 6, 4]. Our interest in this subject stems primarily from a desire to improve and deepen the techniques which are available for reasoning about program behaviour in the impure functional language Standard ML [9] Our motivation here is to try to identify what, if any, are the difficulties created ....

M. Felleisen and D. P. Friedman. A Syntactic Theory of Sequential State, Theoretical Computer Science 69(1989) 243--287.

....provided at the detriment of one another. This fact is clearly demonstrated and amply illustrated in [AKN86, AKN89, AK91a, AKP91b, AKP91a, AKM90] More importantly, they need not preclude the more conventional state effecting style of explicit control and data processing of imperative programming [FF89, Fel87] Therefore, we believe that it is quite feasible to set up a concrete and rigorous design plan based on building three primeval abstractions which could allow retrieving of most particular programming styles as instances, with the additional freedom of manipulating these abstractions ....

Matthias Felleisen and Daniel Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989.

....integrating the transition system intuition with higher order functional features. Since we reject assignment and assignable variables as primitive concepts, the resulting calculus is quite different from other approaches to integrate imperative and functional paradigms, such as reported in, e.g. [8, 9, 10, 20]. In particular, although we have a notion of state we do not have an implicit store; instead, this can be modelled as a specific kind of state. Address: Postfach 101363, D 31113 Hildesheim. Email: rensink informatik.uni hildesheim.de. Research partially supported by the HCM Cooperation ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Comput. Sci., 69:243--287, 1989.

....this is what compilers do) even though such reductions may not occur during execution. The novelty of S lies in the way it treats barriers and side effects. In the FP literature, introduction of side effects is usually in the context of a sequential operational semantics (see, for example, [12] and [16] for call by value languages, or state monads in Haskell [15] and state is often modeled by a single global store with sequential operations. S , on the other hand, introduces no such sequentialization, nor a separate store. The store is distributed throughout the term and we give ....

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989.

....evaluation contexts instead because it is our goal to develop an equational characterization of call by need evaluation. z Adopting this equation as the replacement of fi also leads to inconsistencies in extensions of the equational theory with cyclic data definitions or imperative facilities (Felleisen Friedman, 1989; Ariola Klop, 1994) We consider this problem a further indictment of the unrestricted context in the proposed axiom. 8 Zena M. Ariola and Matthias Felleisen We thus arrive at the following axiom for substituting procedure parameters with the values of their arguments: deref : x:E[x] V = ....

Felleisen, M., & Friedman, D. P. (1989). A syntactic theory of sequential state. Theoretical Computer Science, 69(3), 243--287.

No context found.

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989.

No context found.

M. Felleisen and D. P. Friedman. A Syntactic Theory of Sequential State, Theoretical Computer Science 69(1989) 243--287.

No context found.

M. Felleisen and D. P. Friedman. A syntactic theory of sequential state. Theoretical Computer Science, 69:243--287, 1989. (p. 125)

No context found.

M. Felleisen and D. P. Friedman. A Syntactic Theory of Sequential State, Theoretical Computer Science 69(1989) 243--287.

No context found.

M. Felleisen, D. P. Friedman. A syntactic theory of sequential state. Theoret. Comput. Sci., 69(3), 1989.

No context found.

Felleisen, M., and Friedman, D. P. A syntactic theory of sequential state. In Theoretical Computer Science, volume 69, number 3, pages 243-287, 1989.

No context found.

M. Felleisen, D. P. Friedman. A syntactic theory of sequential state. Theoret. Comput. Sci., 69(3), 1989.

First 50 documents

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