A survey of state vectors
From MaRDI portal
Publication:458456
DOI10.1016/j.cosrev.2008.02.003zbMath1302.68116OpenAlexW1494212109MaRDI QIDQ458456
Publication date: 7 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2008.02.003
Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03)
Uses Software
Cites Work
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Program schemes, recursion schemes, and formal languages
- The validity of return address schemes
- Time bounded random access machines
- Bounded action machines: toward an abstract theory of computer structure
- Some definitional suggestions for automata theory
- Regular expressions and the equivalence of programs
- Some results concerning proofs of statements about programs
- On formalised computer programs
- Equivalences on program schemes
- Programming by induction
- Eine Abstrakte Programmgesteuerte Rechenmaschine
- Recursive functions of symbolic expressions and their computation by machine, Part I
- How to Program an Infinite Abacus
- Parsing algorithms with backtrack
- Axioms and Theorems for a Theory of Arrays
- Correspondence between ALGOL 60 and Church's Lambda-notation
- A formal semantics for computer languages and its application in a compiler-compiler
- EULER: A generalization of ALGOL and its formal definition: Part 1
- Flow diagrams, turing machines and languages with only two formation rules
- The next 700 programming languages
- GRAPHSCHEMATA UND REKURSIVE FUNKTIONEN
- Some Completeness Results in the Mathematical Theory of Computation
- Translator writing systems
- Proving Properties of Programs by Structural Induction
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- A constructive approach to the problem of program correctness
- Semantics of context-free languages
- Programming Languages and Computers: A Unified Metatheory
- The outer and inner syntax of a programming language
- A Theory of Computer Instructions
- An axiomatic basis for computer programming
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- Algorithmic properties of structures
- Proving programs correct: Some techniques and examples
- Flowchart machines
- Semantic Translation of Programming Languages
- Semantics of context-free languages: Correction
- Computational complexity of random access stored program machines
- The Formal Definition of the BASIC Language
- Proving Programs to be Correct
- Proving algorithms by tail functions
- Fixpoint approach to the theory of computation
- Derived semantics for some programming language constructs
- Optimization of Straight Line Programs
- Subrecursive Programming Languages, Part I
- A semantic extension of BNF
- An Informal Arithmetical Approach to Computability and Computation
- On the nonexistence of a phrase structure grammar for ALGOL 60
- Computability of Recursive Functions
- On Ianov's Program Schemata
- The Mechanical Evaluation of Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
