scientific article; zbMATH DE number 177847

MaRDI QIDQ4038725zbMATH OpenFDO

Authors John V. Tucker, Stanley S. Wainer, Jeffery Zucker

Publication date 18 May 1993

zbMATH Keywords

abstract data typescomputabilitycorrectnessformal systems of program propertiesmany-sorted algebrasprovabilityrecursivenessterminationverifiability

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 432708
• Logical Approaches to Computational Barriers
• Primitive recursive selection functions for existential assertions over abstract algebras
• An external approach to abstract data types. I: Computability on abstract data type
• scientific article; zbMATH DE number 5033764

Cited in

(12)

• The functions provable by first order abstraction
• scientific article; zbMATH DE number 4134036 (Why is no real title available?)
• scientific article; zbMATH DE number 432708 (Why is no real title available?)
• An external approach to abstract data types. I: Computability on abstract data type
• scientific article; zbMATH DE number 4135384 (Why is no real title available?)
• scientific article; zbMATH DE number 4007703 (Why is no real title available?)
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• scientific article; zbMATH DE number 176743 (Why is no real title available?)
• scientific article; zbMATH DE number 408790 (Why is no real title available?)
• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• Logical Approaches to Computational Barriers
• Primitive recursive selection functions for existential assertions over abstract algebras

Describes a project that uses

Uses Software

• Nuprl

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 Q4038725)