scientific article
From MaRDI portal
Publication:4055144
zbMath0301.68014MaRDI QIDQ4055144
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Unnamed Item ⋮ Unnamed Item ⋮ Algebraic-grammatical models of parallel computation ⋮ Datalogy - the Copenhagen tradition of computer science ⋮ The tree-width of C ⋮ Dijkstra graphs ⋮ A structured program to generate all topological sorting arrangements ⋮ High-performance generation of the Hamiltonian and overlap matrices in FLAPW methods ⋮ Correctness of the compiling process based on axiomatic semantics ⋮ Fundamentals of reversible flowchart languages ⋮ The Schorr-Waite marking algorithm revisited ⋮ The independence of control structures in abstract programming systems ⋮ The complexity of register allocation ⋮ Event-driven control statements ⋮ Steady-paced-output and fractional-on-line algorithms on a RAM ⋮ Boolean-valued loops ⋮ A case study in program transformation ⋮ Stack and locally finite transformations on structures with reversible transitions ⋮ More comments on the programming language Pascal ⋮ Axiomatic approach to side effects and general jumps ⋮ The analysis of Quicksort programs ⋮ Language design methods based on semantic principles ⋮ An analysis of alpha-beta pruning ⋮ SUBSTAD: for fast substitution in LISP, with an application on unification ⋮ Proving programs correct through refinement ⋮ On removing the machine from the language ⋮ A contribution to the programming calculus ⋮ Provably correct derivation of algorithms using FermaT ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Unnamed Item ⋮ NP-Complete operations research problems and approximation algorithms ⋮ All structured programs have small tree width and good register allocation ⋮ Synthetic programming ⋮ Recursive information transducers: Computation models
This page was built for publication: