Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis

DOI10.1007/11506676_17MaRDI QIDQ5458807zbMATH OpenOpenAlexFDO

Authors J. B. Wells, Boris Yakobowski

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11506676_17

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• From program verification to program synthesis
• scientific article; zbMATH DE number 3934387
• Look for the proof to find the program: decorated-component-based program synthesis
• scientific article; zbMATH DE number 4020482
• Synthesis of functional programs with help of first-order intuitionistic logic

Cited in

(6)

• Counting proofs in propositional logic
• A coinductive approach to proof search through typed lambda-calculi
• Finite combinatory logic with intersection types
• Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
• Proofs that count
• Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic

This page was built for publication: Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis

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