Recursive data structures
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3485177 (Why is no real title available?)
- scientific article; zbMATH DE number 3431773 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A contribution to the development of ALGOL
- A generalized technique for symbol manipulation and numerical calculation
- Proof of correctness of data representations
- Proving Properties of Programs by Structural Induction
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Report on the algorithmic language ALGOL 68
- The programming language Pascal
Cited in
(13)- Mechanizing structural induction. II: Strategies
- A set constructor for inductive sets in Martin-Löf's type theory
- Mechanizing structural induction. I: Formal system
- Solving constrained Horn clauses over algebraic data types
- Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees
- Inheritance hierarchies: Semantics and unifications
- Algebraic specification of data types: A synthetic approach
- On removing the machine from the language
- A logic of reachable patterns in linked data-structures
- Explicit cyclic substitutions
- More comments on the programming language Pascal
- A view of computability on term algebras
- Language design methods based on semantic principles
This page was built for publication: Recursive data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055171)
