Deduction and Declarative Programming

DOI10.1017/CBO9780511569876zbMath0757.68077MaRDI QIDQ4023582

Peter Padawitz

Publication date: 23 January 1993

zbMATH Keywords

functional programmingproof systemprogram specifications

Mathematics Subject Classification ID

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

Related Items (max. 100)

Generic induction proofs ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ An upper bound on the derivational complexity of Knuth-Bendix orderings. ⋮ A general framework to build contextual cover set induction provers ⋮ Swinging types=functions+relations+transition systems ⋮ Expander2: Program Verification Between Interaction and Automation

Uses Software

• ML
• EXPANDER

This page was built for publication: Deduction and Declarative Programming