Wellfounded schematic definitions

DOI10.1007/10721959_4MaRDI QIDQ2723408zbMATH OpenFDO

Authors Konrad Slind

Publication date 5 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721959_4

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Some equivalent transformations of recursive programs based on their schematic properties
• Well-founded Relations in Type Theory
• Program development schemata as derived rules
• scientific article; zbMATH DE number 2185691
• scientific article; zbMATH DE number 3963179

Cited in

(5)

• Adapting functional programs to higher order logic
• Proof producing synthesis of arithmetic and cryptographic hardware
• scientific article; zbMATH DE number 2185691 (Why is no real title available?)
• Some equivalent transformations of recursive programs based on their schematic properties
• Nominal techniques in Isabelle/HOL

Describes a project that uses

Uses Software

• Isabelle/HOL
• Isabelle

This page was built for publication: Wellfounded schematic definitions

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