ALGOL 60
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Bi-inductive structural semantics
- Operational semantics: concepts and their expression
- Hardware/software co-design then and now
- An algorithm for the computation of zeros of a special class of entire functions
- A note on Parikh maps, abstract languages, and decision problems
- Macro tree transducers
- A theory for nondeterminism, parallelism, communication, and concurrency
- On regular trace languages
- Characteristics of graph languages generated by edge replacement
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Hierarchies of one-way multihead automata languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Annotated bibliography on partial evaluation and mixed computation
- A guided tour of the mathematics of MetaSoft '88
- Procedures, parameters, and abstraction: Separate concerns
- Datalogy - the Copenhagen tradition of computer science
- Ein ALGOL-Programm für die Behandlung der Neutronenstreuung eines Flüssigkeitsszintillators nach der Monte-Carlo-Methode
- Static procedure identification in compilers for Algol-type languages
- The formal termination problem for programs with finite ALGOL 68-modes
- A method for transforming grammars into LL(k) form
- Bounds for the norm of certain spline projections
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Order-convergence and iterative interval methods
- Formal description of context conditions of ALGOL 60
- Introduction of FORMULA type into ALGOL 60
- Programming language ALGOL 68
- An algorithm for numerical differentiation of a function of one real variable
- Computational methods of linear algebra
- Two iteration theorems for the LL(k) languages
- Compilation of an extension of ALGOL
- Interdependent translation schemes
- An algorithm for the computation of the exponential spline
- Fundamentals of SIGLA, an interval computing system over the completed set of intervals
- SR(s,k) parsers: A class of shift-reduce bounded-context parsers
- Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages
- Hierarchical development of programming languages
- The IO- and OI-hierarchies
- On termination problems for finitely interpreted ALGOL-like programs
- 2DST mappings of languages and related problems
- An efficient matrix algorithm for the calculation of the gradient of the conformational energy of polymer chains
- Access mechanisms in block structured environments
- Formalization in program development
- A method for the computation of bounds with convergence of arbitrary order for ordinary linear boundary value problems
- A comparative performance evaluation of 27 nonlinear programming codes
- An abstract data type for name analysis
- Static semantics, types, and binding time analysis
- Informatik 1. Ein einführende Übersicht. (Computer science 1. An introductory survey.)
- Extended regular expressions of arbitrary star degrees
- The ring of k-regular sequences
- On global optimization using interval arithmetic
- A theory for program and data type specification
- Learning semilinear sets from examples and via queries
- More comments on the programming language Pascal
- Two iteration theorems for some families of languages
- The decidability of a mapping problem for generalized sequential machines with final states
- Ambiguity and precedence in syntax description
- On procedures as open subroutines. II
- Are two context-free languages translatable in a syntax-directed translation scheme?
- Attributed translations
- SEMANOL (73), a metalanguage for programming the semantics of programming languages
- Sequence-to-sequence recursiveness
- Transductions des langages de Chomsky
- Random matroids
- An algorithm for the interpolation of functions using quintic splines
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Language design methods based on semantic principles
- Bounded AFLs
- Resolution of ambiguity in parsing
- A useful device for showing the solvability of some decision problems
- Proving containment of bounded AFL
- Formula manipulations solving linear ordinary differential equations. II
- Finite automata with multiplication
- Stability and convergence of monotonic algorithms
- Output driven interpretation of recursive programs, or writing creates and destroys data structures
- Correctness of parallel programs: The Church-Rosser approach
- IO and OI. I
- PASCAL in LCF: Semantics and examples of proof
- IO and OI. II
- Programme zum Zeichnen von allgemeinen Flächenstücken
- Langages algébriques, paires iterantes et transductions rationnelles
- A method for proving programming languages non context-free
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari
- Counting productions in context-free derivations
- Fast algorithms for the conjugate periodic function
- Some decision problems concerning sequential transducers and checking automata
- On computer generation of balanced arrays
- A syntactic theory of sequential state
- All structured programs have small tree width and good register allocation
- Pushdown cellular automata
- On a generalized product for domains
- Numerics of Gram-Schmidt orthogonalization
- Correctness of fixpoint transformations
- MATHLAB
- CAMAL
- The translation power of top-down tree-to-graph transducers
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Modularity and reusability in attribute grammars
- Periodic sets of integers
- On the language of primitive words
- RFSFNS
This page was built for software: ALGOL 60
