scientific article; zbMATH DE number 3430635
From MaRDI portal
Publication:5181349
zbMath0274.02015MaRDI QIDQ5181349
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Computability and recursion theory (03D99)
Related Items
Merging regular processes by means of fixed-point theory, Euler-Chebyshev methods for integro-differential equations, The development of Runge-Kutta methods for partial differential equations, A proof system for the first-order relational calculus, CPO's of measures for nondeterminism, An algebraic definition for control structures, Floyd's principle, correctness theories and program equivalence, Unnamed Item, Unnamed Item, Structured implementation of symbolic execution: A first part in a program verifier, Unnamed Item, Completeness results for the equivalence of recursive schemas, Least fixed points revisited, On the completeness of the inductive assertion method, Explicit Runge-Kutta methods for parabolic partial differential equations, The convergence of functions to fixedpoints of recursive definitions, Algebraic specification of data types: A synthetic approach, Recursion induction principle revisited, Verifying programs by induction on their data structure: general format and applications, Proving program inclusion using Hoare's logic, Average case optimality for linear problems, Programs and logics
