scientific article; zbMATH DE number 3502750
From MaRDI portal
zbMath0321.68002MaRDI QIDQ4082975
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items
Partial parametrization eliminates multiple traversals of data structures, Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant, The Peter Landin prize, Generating power of lazy semantics, A method for transforming grammars into LL(k) form, Folding left and right matters: Direct style, accumulators, and continuations, Call-by-value combinatory logic and the lambda-value calculus, Algebraic simplification in computer algebra: an analysis of bottom-up algorithms, Refunctionalization at work, A complexity calculus for recursive tree algorithms, Precedences in specifications and implementations of programming languages, Combinator Parsers: From Toys to Tools, Structured debugging using a domain specific language, Combinator Parsing: A Short Tutorial, Unbounded computational structures, Output driven interpretation of recursive programs, or writing creates and destroys data structures, A new implementation technique for applicative languages, A theory of type polymorphism in programming, Algebraic specification of data types: A synthetic approach, Defining concurrent processes constructively
