Deduction and Declarative Programming

DOI10.1017/CBO9780511569876MaRDI QIDQ4023582zbMATH OpenFDO

Authors Peter Padawitz

Publication date 23 January 1993

zbMATH Keywords

functional programmingproof systemprogram specifications

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• An approach to declarative programming based on a rewriting logic
• scientific article; zbMATH DE number 49478
• scientific article; zbMATH DE number 3913653
• scientific article; zbMATH DE number 814830
• scientific article; zbMATH DE number 3945331

Cited in

(12)

• Information-gain computation in the \textsc{Fifth} system
• scientific article; zbMATH DE number 1974021 (Why is no real title available?)
• An upper bound on the derivational complexity of Knuth-Bendix orderings.
• Variable declarations in natural deduction
• Generic induction proofs
• scientific article; zbMATH DE number 871157 (Why is no real title available?)
• Swinging types=functions+relations+transition systems
• Declarative programming: a logical view
• Test sets for the universal and existential closure of regular tree languages.
• A general framework to build contextual cover set induction provers
• On GCLA, Gisela, and MedView. Studies in declarative programming with application to clinical medicine
• Expander2: program verification between interaction and automation

Describes a project that uses

Uses Software

• EXPANDER
• ML

This page was built for publication: Deduction and Declarative Programming

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