P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....This combination makes the language very expressive. For example, simple forms of classes and objects may be encoded in IA [1] For these reasons, IA has attracted a great deal of attention from theoreticians; some 20 papers spanning almost 20 years of research were recently collected in book form [2]. A common theme in the literature on semantics of IA, beginning with [3] is the use of putative program equivalences to test suitability of semantic models. These example equivalences are intended to capture intuitively valid princiPreprint submitted to Theoretical Computer Science 28 April ....

P. W. O'Hearn, R. D. Tennent (Eds.), Algol-like Languages, Progress in Theoretical Computer Science, Birkhauser, Boston, 1997, two volumes.

....with local (block) variables and local arrays. This is a non trivial imperative language core which can be used for many algorithmic programming tasks. The language is also technically interesting because the interaction between local variables and procedures has been notoriously dicult to model [18]. The abstract syntax and the typing rules for the language are presented in detail in Appendix A. In the rest of the section we will brie y discuss some of the highlights of this language. The data types of the language, i.e. the types of values assignable to variables, are bounded integers ....

O'Hearn, P. W. and R. D. Tennent, editors, \Algol-like Languages," Progress in Theoretical Computer Science, Birkhauser, Boston, 1997, two volumes.

....combination makes the language very expressive. For example, simple forms of classes and objects may be encoded in IA [23] For these reasons, IA has attracted a great deal of attention from theoreticians; some 20 papers spanning almost 20 years of research were recently collected in book form [18]. A common theme in the literature on semantics of IA, beginning with [13] is the use of putative program equivalences to test suitability of semantic models. These example equivalences are intended to capture intuitively valid principles such as the privacy of local variables, irreversibility of ....

P. W. O'Hearn and R. D. Tennent, editors. Algol-like Languages. Progress in Theoretical Computer Science. Birkhauser, Boston, 1997. Two volumes.

....version of the above definition together with a syntactic counterpart in terms of the computational # calculus, and proved adequacy results. But such results leave some scope for a precise choice of appropriate semantic axioms. Enrichment allows us to capture examples such as local state [11], where V is the category # Cpo of # cpo s, i.e, the category of posets with sups of # chains, and C is the # Cpo category [W, # Cpo] where W is a category of worlds. So, in an enriched setting, we prove a range of equivalence results, which we believe provide strong evidence for the ....

P. W. O'Hearn and R. D. Tennent, Algol-like Languages, Progress in Theoretical Computer Science, Boston: Birkhauser, 1997.

....with local (block) variables and local arrays. This is a non trivial imperative language core which can be used for many algorithmic programming tasks. The language is also technically interesting because the interaction between local variables and procedures has been notoriously dicult to model [18]. The abstract syntax and the typing rules for the language are presented in detail in Appendix A. In the rest of the section we will brie y discuss some of the highlights of this language. The data types of the language, i.e. the types of values assignable to variables, are bounded integers (int) ....

O'Hearn, P. W. and R. D. Tennent, editors, \Algol-like Languages," Progress in Theoretical Computer Science, Birkhauser, Boston, 1997, two volumes.

.... for the FISh types is given by ffi : D : int j bool j float j char j : ff : A : X j ffi j [ff] oe : Sh : ffi j #ff : T : ff j oe : P : U j #U j comm j var ff j exp j OE : S : j 8X : A: OE j 8U : P: OE Following after Reynold s account of Algol like languages [Rey81, OT97] FISh distinguishes the data types (metavariable ) which represent storable values, from the phrase types (meta variable ) which represent meaningful program fragments. The data types are further divided into the array types (meta variable ff) which are used to store arrays of data, and the ....

P.W. O'Hearn and R.D. Tennent, editors. Algollike Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

....arity of #. One can speak of derived operations as usual, and of equations between derived operations. We henceforth assume that C is fixed, leading examples being Set, P oset, # Cpo, presheaf categories [W, Set] and functor categories of the form [W, # Cpo] for a small category of worlds W , cf [13]. So, given a finitary signature # and equations E between derived operations, we have the notion of a (#, E) algebra in C. This notion, with the evident definition of homomorphism of algebras, generates a category (#, E) Alg with a forgetful functor U : #, E) Alg # C which, if C has all ....

....that U is monadic. 4 Local state We now consider local state and see how its models can be seen in terms of operations and equations, extending those for global state in a principled fashion. In order to do that, we first need a natural statement of what the models of local state are. We follow [13], as further studied in [9] Following [13] we do not model local state in terms of a category with axiomatically given structure as we have done for global state, but rather we restrict attention to a particular presheaf category. Our results may generalise to functor categories [I , C] where C ....

[Article contains additional citation context not shown here]

P. W. O'Hearn and R. D. Tennent, Algol-like Languages, Progress in Theoretical Computer Science, Boston: Birkhauser, 1997.

....over nested regular arrays: theory and implementation in FISh C.B. Jay P.A. Steckler y May 11, 1998 1 Introduction FISh is a higher order, polymorphic language for array programming that supports both functional and imperative styles, in the manner of an Algol like language [Rey81, OT97]. Polymorphic array programs can act on arrays with entries of different types, such as integers, floats, or even other arrays. Since these different types all have different storage requirements, it is usual to box the data, i.e. arrays contain pointers to their entries. This is a significant ....

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

....combination makes the language very expressive. For example, simple forms of classes and objects may be encoded in IA [14] For these reasons, IA has attracted a great deal of attention from theoreticians; some 20 papers spanning almost 20 years of research were recently collected in book form [10]. A common theme in the literature on semantics of IA, beginning with [5] is the use of putative program equivalences to test suitability of semantic models. These example equivalences are intended to capture intuitively valid principles such as the privacy of local variables, irreversibility of ....

P. W. O'Hearn and R. D. Tennent, editors. Algol-like Languages. Progress in Theoretical Computer Science. Birkhauser, Boston, 1997. Two volumes.

.... formalised Idealised ALGOL (IA) as a simple imperative language enriched with a procedural mechanism provided by a typed call by name calculus [Rey81] IA combines in an elegant way imperative and functional features, and since its introduction has been the object of extensive study (cf. [OT97]) Concurrent Idealised ALGOL (CIA) was introduced by Brookes as an extension of IA with shared variable parallelism [Bro96] CIA allows parallel composition of commands and features an await operator for imposing atomicity. Brookes [Bro96] has presented an elegant denotational model for CIA, ....

.... [How96] attempts to extend this technique to languages with local state, however, have been unsuccessful so far; see discussions in [FHJ95] A further advantage of the calculus semantics is that, as states are represented by processes, no snapback effects (reversibility of state changes, cf. [AM96,AM97,OT97]) can occur; models representing states by functions usually denotational models do so suffer from snapback effects, which are usually removed by means of logical relations [OT97] Our study is also motivated by the question of how appropriate the calculus is for giving semantics to ....

[Article contains additional citation context not shown here]

P. W. O'Hearn and R. D. Tennent, editors. ALGOL-like Languages. Progress in Theoretical Computer Science. Birkhauser, 1997. Two volumes.

.... calculus techniques. 2 Concurrent Idealized ALGOL Reynolds formalized Idealized ALGOL (IA) as a simple imperative language enriched with a procedural mechanism provided by a simply typed call by name calculus [Rey81] Since its introduction, IA has been the object of extensive study (cf. [OT97]) Concurrent Idealized ALGOL (CIA) was introduced by Brookes as an extension of IA with shared variable parallelism [Bro96] In CIA, commands can be composed in parallel, and atomicity can be imposed by an await operator. Brookes has presented an elegant denotational model for CIA, extending a ....

P. W. O'Hearn and R. D. Tennent, editors. ALGOL-like Languages. Progress in Theoretical Computer Science. Birkhauser, 1997. Two volumes.

....above while maintaining static type and shape checking. However, shape analysis can also be profitably thought of within a two level calculus [BM97] or as a means of staging computation [She98] or as a form of partial evaluation [JGS93] The FISh types look like those of Idealised Algol [Rey81, OT97] in that they have been split into data types and phrase types. The former represent storable values, namely regular arrays, while the latter represent program fragments, and include a type comm of commands, as well as function types. This division leads us to support two distinct kinds of type ....

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

....FiSh programs. Thus, FiSh is a novel combination of expressive programming style (supporting higher order, polymorphically typed, functions) and efficient execution that can be integrated with existing imperative languages. 2 The FiSh Language FiSh is essentially an Algol like language [Rey81, OT97] In particular, it supports a sub language Turbot that is a simple imperative language equipped with local variables that obey a stack discipline. Commands act on a store, and function application is call by name. To this base, we add the structure of a typed functional language, which can ....

....Also note that the FiSh combinatory code took approximately five times longer than the loops version. Surprisingly, the O Caml semi combinatory code was faster than its loops version. 4 Relations to other work As mentioned, the FiSh language borrows many features from Algol like languages. OT97] is a collection of much of the historically significant work in this area. Non strict evaluation and type polymorphism are also features of Haskell [HPJW92] While Haskell does feature arrays, speed of array operations is not a particular concern. Key features of FiSh are its collection of ....

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

No context found.

P. W. O'Hearn and R. D. Tennent, editors. Algol-like Languages. Progress in Theoretical Computer Science. Birkhauser, Boston, 1997. Two volumes.

No context found.

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

No context found.

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

No context found.

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

No context found.

P. W. O'Hearn and R. D. Tennent, Algol-like Languages, Progress in Theoretical Computer Science, Boston: Birkhauser, 1997.

No context found.

P. W. O'Hearn and R. D. Tennent, Algol-like Languages, Progress in Theoretical Computer Science, Boston: Birkhauser, 1997.

No context found.

P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, Vols I and II. Progress in Theoretical Computer Science. Birkhauser, 1997.

No context found.

P. W. O'Hearn and R. D. Tennent, editors. Algol-like Languages. Progress in Theoretical Computer Science. Birkhauser, Boston, 1997. Two volumes.

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