Implementation of data types by algebraic methods
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3649971 (Why is no real title available?)
- scientific article; zbMATH DE number 3972168 (Why is no real title available?)
- scientific article; zbMATH DE number 3681119 (Why is no real title available?)
- scientific article; zbMATH DE number 3714981 (Why is no real title available?)
- scientific article; zbMATH DE number 3737005 (Why is no real title available?)
- scientific article; zbMATH DE number 3787995 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 3594631 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3612415 (Why is no real title available?)
- scientific article; zbMATH DE number 3640851 (Why is no real title available?)
- scientific article; zbMATH DE number 1086650 (Why is no real title available?)
- scientific article; zbMATH DE number 3441605 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A generalization of the homomorphism concept
- A generalized approach to formal languages
- Abstract data types and software validation
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Complexity of algebraic implementations for abstract data types
- Continuous Data Types
- Extensions and implementations of abstract data type specifications
- IO and OI. II
- Inductive methods for proving properties of programs
- Initial Algebra Semantics and Continuous Algebras
- On some classes of interpretations
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Program schemes, recursion schemes, and formal languages
- Recursion-closed algebraic theories
- Regular trees and the free iterative theory
- Relative complexity of algebras
- The algebraic specification of abstract data types
- The existence and construction of free iterative theories
- Towards a theory of semantics and compilers for programming languages
- Unique fixed points vs. least fixed points
Cited in
(7)- scientific article; zbMATH DE number 3995032 (Why is no real title available?)
- scientific article; zbMATH DE number 3999266 (Why is no real title available?)
- Hybrid implementations of algebraic specifications
- Algebraic specification of modules and their basic interconnections
- SK implementation of some data types
- On the implementation of abstract data types by programming language constructs
- scientific article; zbMATH DE number 3921971 (Why is no real title available?)
This page was built for publication: Implementation of data types by algebraic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792753)