{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:46:54Z","timestamp":1764557214247},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540266556"},{"type":"electronic","value":"9783540316831"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506676_17","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T12:07:52Z","timestamp":1279454872000},"page":"262-277","source":"Crossref","is-referenced-by-count":12,"title":["Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis"],"prefix":"10.1007","author":[{"given":"J. B.","family":"Wells","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Yakobowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Aponte, M.V., Di Cosmo, R., Dubois, C., Yakobowski, B.: Signature subtyping modulo type isomorphisms (2004) (in preparation)"},{"key":"17_CR2","unstructured":"Ben-Yelles, C.-B.: Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, Mathematics Dept., University of Wales Swansea, UK (1979)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Broda, S., Damas, L.: On the structure of normal \u03bb-terms having a certain type. In: 7th Workshop on Logic, Language, Information and Computation (WoLLIC 2000), Brazil (2000)","DOI":"10.1017\/S1079898600005953"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Dyckhoff, R.: Proof search in constructive logics. In: Logic Colloquium 1997 (1998)","DOI":"10.1017\/CBO9781107325944.004"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Dyckhoff, R., Pinto, L.: Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica\u00a060(1) (1998)","DOI":"10.1023\/A:1005099619660"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dyckhoff, R., Pinto, L.: Permutability of proofs in intuitionistic sequent calculi. Theoret. Comput. Sci.\u00a0212(1\u20132) (1999)","DOI":"10.1016\/S0304-3975(98)00138-8"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Haack, C.: Foundations for a tool for the automatic adaptation of software components based on semantic specifications. PhD thesis, Kansas State University (2001)","DOI":"10.1007\/3-540-45719-4_7"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-45719-4_7","volume-title":"Algebraic Methodology and Software Technology","author":"C. Haack","year":"2002","unstructured":"Haack, C., Howard, B., Stoughton, A., Wells, J.B.: Fully automatic adaptation of software components based on semantic specifications. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, p. 83. Springer, Heidelberg (2002)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H. Herbelin","year":"1995","unstructured":"Herbelin, H.: A \u03bb-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933. Springer, Heidelberg (1995)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Herbelin, H.: A \u03bb-calculus structure isomorphic to Gentzen-style sequent calculus structure (1994), Available at http:\/\/coq.inria.fr\/~herbelin\/LAMBDA-BAR-FULL.dvi.gz","DOI":"10.1007\/BFb0022247"},{"key":"17_CR11","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"J.R. Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science, vol.\u00a042. Cambridge University Press, Cambridge (1997)"},{"key":"17_CR12","unstructured":"Howe, J.M.: Proof Search Issues In Some Non-Classical Logics. PhD thesis, University of St Andrews (1998), http:\/\/www.cs.kent.ac.uk\/pubs\/1998\/946\/"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Extensions of Logic Programming","author":"L. Pinto","year":"1994","unstructured":"Pinto, L.: Cut formulae and logic programming. In: Dyckhoff, R. (ed.) ELP 1993. LNCS, vol.\u00a0798. Springer, Heidelberg (1994)"},{"key":"17_CR14","volume-title":"Electronic Notes in Theoretical Computer Science","author":"L. Pinto","year":"2000","unstructured":"Pinto, L., Dyckhoff, R.: Sequent calculi for the normal terms of the \u03bb\u03a0 and \u03bb\u03a0\u03a3 calculi. In: Galmiche, D. (ed.) Electronic Notes in Theoretical Computer Science, vol.\u00a017. Elsevier, Amsterdam (2000)"},{"key":"17_CR15","unstructured":"Zaionc, M.: Fixpoint technique for counting terms in typed lambda calculus. Technical Report 95-20, State University of New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11506676_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T14:50:47Z","timestamp":1635691847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506676_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266556","9783540316831"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11506676_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}