ALGOL 60
From MaRDI portal
Software:33608
swMATH21807WikidataQ1209759 ScholiaQ1209759MaRDI QIDQ33608FDOQ33608
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- A simple P-complete problem and its language-theoretic representations
- A complete refinement procedure for regular separability of context-free languages
- Counter machines and verification problems.
- Unambiguous Boolean grammars
- A floating-point technique for extending the available precision
- From Algol to polymorphic linear lambda-calculus
- Title not available (Why is that?)
- Practical aspects of interval computation
- Conjunctive grammars with restricted disjunction
- Structural operational semantics through context-dependent behaviour
- Title not available (Why is that?)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- The origins of structural operational semantics
- Deciding determinism of unary languages
- Semantical analysis of specification logic
- Algorithm AS 255: Fitting of Two-Way Tables by Means for Rows, Columns and Cross-Term
- Verification in loosely synchronous queue-connected discrete timed automata.
- Multitape NFA: Weak Synchronization of the Input Heads
- Computational interpretations of linear logic
- Instruction sequence processing operators
- Weakly complete axiomatization of exogenous quantum propositional logic
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Parikh's theorem and descriptional complexity
- Computational methods of linear algebra
- The ring of \(k\)-regular sequences
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- IO and OI. II
- CAMAL 40 Years on – Is Small Still Beautiful?
- An observationally complete program logic for imperative higher-order functions
- The computation of three-dimensional rolling contact with dry friction
- Forward analysis and model checking for trace bounded WSTS
- Title not available (Why is that?)
- The equational logic of fixed points
- A theory for nondeterminism, parallelism, communication, and concurrency
- Equations over sets of integers with addition only
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Bounded underapproximations
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Semantics of context-free languages
- Algorithm AS 155: The Distribution of a Linear Combination of χ 2 Random Variables
- Algorithm AS 153: Pan's Procedure for the Tail Probabilities of the Durbin-Watson Statistic
- Structure and Use of ALGOL 60
- Complexity of equations over sets of natural numbers
- Representing hyper-arithmetical sets by equations over sets of integers
- Language equations with complementation: expressive power
- Unresolved systems of language equations: expressive power and decision problems
- Generalized sequential machine maps
- Language equations with complementation: decision problems
- Recursive descent parsing for Boolean grammars
- IO and OI. I
- Time bounded random access machines
- Decision problems for language equations
- The IO- and OI-hierarchies
- Tree acceptors and some of their applications
- The dual of concatenation
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Scheduling of power generation via large-scale nonlinear optimization
- Generating all permutations by context-free grammars in Chomsky normal form
- Generating all permutations by context-free grammars in Greibach normal form
- Rational sets in commutative monoids
- GARGOYLE
- Context-free languages of sub-exponential growth
- Fundamentals of SIGLA, an interval computing system over the completed set of intervals
- Title not available (Why is that?)
- Macsyma: A personal history
- Fast algorithms for the conjugate periodic function
- The algorithm for identical object searching with bounded worst-case complexity and linear memory
- Boolean grammars
- Programming Languages: GPL, a truly general purpose language
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- Improving the lazy Krivine machine
- EULER: A generalization of ALGOL and its formal definition: Part 1
- Title not available (Why is that?)
- Quantitative fuzzy semantics
- Numerics of Gram-Schmidt orthogonalization
- Computational completeness of equations over sets of natural numbers
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Properties of syntax directed translations
- SEMANOL (73), a metalanguage for programming the semantics of programming languages
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Syntax directed translations and the pushdown assembler
- Descriptional complexity of bounded context-free languages
- Fast recursion formula for weight multiplicities
- Description of developmental languages using recurrence systems
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
- Expressiveness and static analysis of extended conjunctive regular path queries
- Mappings and grammars on trees
- A Note on Solid Partitions
- Efficient LR(1) parsers
- Porous invariants
- Bounded languages described by GF(2)-grammars
- Computable error bounds for nonlinear programming
- Learning semilinear sets from examples and via queries
- Title not available (Why is that?)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
- A theorem on generalizations of proofs
- On lengths of words in context-free languages
This page was built for software: ALGOL 60