Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
- 1 January 2005
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 262-277
- https://doi.org/10.1007/11506676_17
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Fully Automatic Adaptation of Software Components Based on Semantic Specifications*Lecture Notes in Computer Science, 2002
- 7th Workshop on Logic, Language, Information and Computation (WoLLIC'2000)Bulletin of Symbolic Logic, 2001
- Proof Search in Constructive LogicsPublished by Cambridge University Press (CUP) ,1999
- Permutability of proofs in intuitionistic sequent calculiTheoretical Computer Science, 1999
- Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic LogicStudia Logica, 1998
- Basic Simple Type TheoryPublished by Cambridge University Press (CUP) ,1997
- A λ-calculus structure isomorphic to Gentzen-style sequent calculus structureLecture Notes in Computer Science, 1995