scientific article; zbMATH DE number 3911688

zbMATH Open0571.68013MaRDI QIDQ3687693FDOQ3687693

Authors: Deepak Kapur, David R. Musser 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• Algebraic specifications of computable and semicomputable data types
• scientific article; zbMATH DE number 3907753
• scientific article; zbMATH DE number 4128365
• scientific article; zbMATH DE number 3900135
• scientific article; zbMATH DE number 4092742

zbMATH Keywords

abstract data typesalgebraic specificationsabstract algebraformal proof methodsrewrite rule theorystructure typestype specificationstypes in programming methodology

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05)

Cited In (17)

• Constructing a theory of a data structure as an aid to program development
• Recent trends in data type specification. 5th workshop on specification of abstract data types, Gullane, Scotland, September 1-4, 1987. Selected papers
• Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
• Modification of the IOTA method for non-hierarchical types
• Proof by consistency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Syntax-guided rewrite rule enumeration for SMT solvers
• A method of elimination of data structures based on formula rewriting systems
• Recent Trends in Data Type Specification
• History and basic features of the critical-pair/completion procedure
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• Title not available (Why is that?)
• Title not available (Why is that?)
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687693)