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

DOI10.1007/11506676_17zbMath1134.68354OpenAlexW1544048926MaRDI QIDQ5458807

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)

Related Items (4)

A coinductive approach to proof search through typed lambda-calculi ⋮ Finite Combinatory Logic with Intersection Types ⋮ Counting proofs in propositional logic ⋮ Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search

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