Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
From MaRDI portal
Publication:5458807
DOI10.1007/11506676_17zbMath1134.68354MaRDI QIDQ5458807
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
68N18: Functional programming and lambda calculus
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search, Counting proofs in propositional logic, A coinductive approach to proof search through typed lambda-calculi, Finite Combinatory Logic with Intersection Types