Graph-based proof counting and enumeration with applications for program fragment synthesis

Lecture Notes in Computer Science

Volumn 3573, Issue , 2005, Pages 262-277

  Wells, J B ^a   Yakobowski, Boris ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; PROBLEM SOLVING;

INTUITIONISTIC LOGIC CALCULUS; PROGRAM SYNTHESIS; PROOF COUNTING;

GRAPH THEORY;

EID: 26444604782     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506676_17     Document Type: Conference Paper

References (15)

1. M. V. Aponte, R. Di Cosmo, C. Dubois, B. Yakobowski. Signature subtyping modulo type isomorphisms. In preparation, 2004.
2. C.-B. Ben-Yelles. Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, Mathematics Dept., University of Wales Swansea, UK, 1979.
3. S. Broda, L. Damas. On the structure of normal λ-terms having a certain type. In 7th Workshop on Logic, Language, Information and Computation (WoLLIC 2000), Brazil, 2000.
4. R. Dyckhoff. Proof search in constructive logics. In Logic Colloquium '97, 1998.
5. R. Dyckhoff, L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60(1), 1998.
6. R. Dyckhoff, L. Pinto. Permutability of proofs in intuitionistic sequent calculi. Theoret. Comput. Sci., 212(1-2), 1999.
7. C. Haack. Foundations for a tool for the automatic adaptation of software components based on semantic specifications. PhD thesis, Kansas State University, 2001.
8. C. Haack, B. Howard, A. Stoughton, J. B. Wells. Fully automatic adaptation of software components based on semantic specifications. In Algebraic Methodology & Softw. Tech., 9th Int'l Conf., AMAST 2002, Proc., vol. 2422 of LNCS. Springer-Verlag, 2002.
9. H. Herbelin. A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure. In Proc. Conf. Computer Science Logic, vol. 933 of LNCS. Springer-Verlag, 1994.
10. H. Herbelin. A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure. Available at http://coq.inria.fr/~herbelin/LAMBDA- BAR-FULL.dvi.gz, 1994.
11. J. R. Hindley. Basic Simple Type Theory, vol. 42 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997.
12. J. M. Howe. Proof Search Issues In Some Non-Classical Logics. PhD thesis, University of St Andrews, 1998.
13. L. Pinto. Cut formulae and logic programming. In R. Dyckhoff, ed., Extensions of Logic Programming: Proc. of the 4th International Workshop ELP'93. Springer-Verlag, 1994.
14. L. Pinto, R. Dyckhoff. Sequent calculi for the normal terms of the λII and λII Σ calculi. In D. Galmiche, ed., Electronic Notes in Theoretical Computer Science, vol. 17. Elsevier, 2000.
15. M. Zaionc. Fixpoint technique for counting terms in typed lambda calculus. Technical Report 95-20, State University of New York, 1995.