Algol-like Languages

  title={Algol-like Languages},
  author={Ronald V. Book},
  booktitle={Progress in Theoretical Computer Science},
  • R. V. Book
  • Published in
    Progress in Theoretical…
  • Medicine
From the combination of knowledge and actions, someone can improve their skill and ability. It will lead them to live and work much better. This is why, the students, workers, or even employers should have reading habit for books. Any book will give certain knowledge to take all benefits. This is what this algol like languages tells you. It will add more knowledge of you to life and work better. Try it and prove it. 
University of Birmingham Latent semantic analysis of game models using LSTMs
LSTM is used, a technique which proved effective in learning natural languages for automatic translation and text synthesis, to learn game-semantic models of sequential and concurrent versions of Idealised Algol, which are algorithmically complex yet can be concisely described.
The regular-language semantics of second-order idealized ALGOL
From Algol to polymorphic linear lambda-calculus
This work translates two variations on Algol 60 into a purely functional language with polymorphic linear types, and demonstrates that a linearly-typed functional language can be at least as expressive as AlGol.
The Regular-Language Semantics of First-Order Idealized Algol
It is explained how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol by expressing sets of complete plays as regular languages using a meta-language of extended regular expressions, a language for which equivalence is decidable.
Reasoning about Idealized ALGOL Using Regular Languages
It is shown that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable, which makes it uniquely suitable for automation.
Logic for Computational Effects: Work in Progress
A possible logic that will allow us to give a unified approach to reasoning about computational effects by extending Moggi's computational λ-calculus by basic types and a signature is outlined.
Intuitionistic reasoning about shared mutable data structure
This work extends Hoare's approach to proving the correctness of imperative programs, to deal with programs that perform destructive updates to data structures containing more than one pointer to the same location.
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
An axiomatic approach to logical relations and data refinement is introduced and it is proved that any relation between models of such a sketch in a semantic category satisfies a soundness condition and such relations compose.
On linear types and imperative update
This thesis investigates the extent to, and the sense in which, programming languages based on linear logic are simultaneously imperative and purely functional, and to what extent they embody the strengths of each programming paradigm.