{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:17Z","timestamp":1725670037013},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_7","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"104-118","source":"Crossref","is-referenced-by-count":4,"title":["Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs"],"prefix":"10.1007","author":[{"given":"Ana","family":"Bove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Dybjer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Sicard-Ram\u00edrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11559306_17","volume-title":"Frontiers of Combining Systems","author":"A. Abel","year":"2005","unstructured":"Abel, A., Coquand, T., Norell, U.: Connecting a Logical Framework to a First-Order Logic Prover. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 285\u2013301. Springer, Heidelberg (2005)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739\u2013782. North-Holland Publishing Company (1977)","DOI":"10.1016\/S0049-237X(08)71120-0"},{"key":"7_CR3","series-title":"Report No. 2, Department of Philosopy","first-page":"1","volume-title":"Proc. of the Symposium on Mathematical Logic (Oulu, 1974)","author":"P. Aczel","year":"1977","unstructured":"Aczel, P.: The strength of Martin-L\u00f6f\u2019s intuitionistic type theory with one universe. In: Miettinen, S., V\u00e4\u00e4nanen, J. (eds.) Proc. of the Symposium on Mathematical Logic (Oulu, 1974). Report No. 2, Department of Philosopy, pp. 1\u201332. University of Helsinki, Helsinki (1977)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0049-237X(08)71252-7","volume-title":"The Kleene Symposium","author":"P. Aczel","year":"1980","unstructured":"Aczel, P.: Frege structures and the notions of proposition, truth and set. In: Barwise, J., et al. (eds.) The Kleene Symposium, pp. 31\u201359. North-Holland, Amsterdan (1980)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Benl, H., et al.: Proof theory at work: Program development in the Minlog system. In: Bibel, W., et al. (eds.) Automated Deduction, vol.\u00a0II, pp. 41\u201371. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-94-017-0435-9_2"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1017\/S0960129505004822","volume":"15","author":"A. Bove","year":"2005","unstructured":"Bove, A., Capretta, V.: Modelling general recursion in type theory. Math. Struct. in Comp. Science\u00a015, 671\u2013708 (2005)","journal-title":"Math. Struct. in Comp. Science"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bove, A., Dybjer, P., Sicard-Ram\u00edrez, A.: Embedding a Logical Theory of Constructions in Agda. In: PLPV 2009, pp. 59\u201366 (2009)","DOI":"10.1145\/1481848.1481857"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0898-1221(94)00215-7","volume":"29","author":"R.S. Boyer","year":"1995","unstructured":"Boyer, R.S., Kaufmann, M., Moore, J.S.: The Boyer-Moore theorem prover and its interactive enhancement. Computers & Mathematics with Applications\u00a029(2), 27\u201362 (1995)","journal-title":"Computers & Mathematics with Applications"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-15975-4_46","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Dybjer","year":"1985","unstructured":"Dybjer, P.: Program Verification in a Logical Theory of Constructions. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.\u00a0201, pp. 334\u2013349. Springer, Heidelberg (1985)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6423(90)90058-L","volume":"14","author":"P. Dybjer","year":"1990","unstructured":"Dybjer, P.: Comparing integrated and external logics of functional programs. Science of Computer Programming\u00a014, 59\u201379 (1990)","journal-title":"Science of Computer Programming"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01887211","volume":"1","author":"P. Dybjer","year":"1989","unstructured":"Dybjer, P., Sander, H.P.: A functional programming approach to the specification and verification of concurrent systems. Formal Aspects of Computing\u00a01, 303\u2013319 (1989)","journal-title":"Formal Aspects of Computing"},{"key":"7_CR12","unstructured":"Gardner, P.: Representing Logics in Type Theory. Ph.D. thesis. University of Edinburgh, Department of Computer Science (1992)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF","author":"M. Gordon","year":"1979","unstructured":"Gordon, M., Wadsworth, C.P., Milner, R.: Edinburgh LCF. LNCS, vol.\u00a078. Springer, Heidelberg (1979)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. JACM\u00a040(1), 143\u2013184 (1993)","journal-title":"JACM"},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1017\/S0956796805005666","volume":"15","author":"W.L. Harrison","year":"2005","unstructured":"Harrison, W.L., Kieburtz, R.B.: The logic of demand in Haskell. Journal of Functional Programming\u00a015(6), 837\u2013891 (2005)","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10817-009-9157-2","volume":"44","author":"A. Krauss","year":"2010","unstructured":"Krauss, A.: Partial and nested recursive function definitions in higher-order logic. Journal of Automated Reasoning\u00a044(4), 303\u2013336 (2010)","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11617990_10","volume-title":"Types for Proofs and Programs","author":"F. Lindblad","year":"2006","unstructured":"Lindblad, F., Benke, M.: A Tool for Automated Theorem Proving in Agda. In: Filli\u00e2tre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol.\u00a03839, pp. 154\u2013169. Springer, Heidelberg (2006)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, pp. 179\u2013216. North-Holland Publishing Company (1971)","DOI":"10.1016\/S0049-237X(08)70847-4"},{"issue":"10","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1016\/j.ic.2005.05.010","volume":"204","author":"J. Meng","year":"2006","unstructured":"Meng, J., Quigley, C., Paulson, L.C.: Automation for interactive proof: First prototype. Information and Computation\u00a0204(10), 1575\u20131596 (2006)","journal-title":"Information and Computation"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-46028-4_4","volume-title":"Implementation of Functional Languages","author":"M. Mol de","year":"2002","unstructured":"de Mol, M., van Eekelen, M., Plasmeijer, R.: Theorem Proving for Functional Programmers. Sparkle: A Functional Theorem Prover. In: Arts, T., Mohnen, M. (eds.) IFL 2001. LNCS, vol.\u00a02312, pp. 55\u201371. Springer, Heidelberg (2002)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","volume":"3","author":"D. Park","year":"1976","unstructured":"Park, D.: Finitess is mu-ineffable. Theoretical Computer Science\u00a03, 173\u2013181 (1976)","journal-title":"Theoretical Computer Science"},{"key":"7_CR22","series-title":"LNCS","volume-title":"Isabelle. A Generic Theorem Prover","author":"L.C. Paulson","year":"1994","unstructured":"Paulson, L.C.: Isabelle. A Generic Theorem Prover. LNCS, vol.\u00a0828. Springer, Heidelberg (1994) (With a contribution by T. Nipkow)"},{"key":"7_CR23","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press (2003)"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1997","unstructured":"Plotkin, G.: LCF considered as a programming language. Theoretical Computer Science\u00a05(3), 223\u2013255 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"730","DOI":"10.2307\/2274128","volume":"49","author":"J. Smith","year":"1984","unstructured":"Smith, J.: An interpretation of Martin-L\u00f6f\u2019s type theory in a type-free theory of propositions. The Journal of Symbolic Logic\u00a049(3), 730\u2013753 (1984)","journal-title":"The Journal of Symbolic Logic"},{"issue":"4","key":"7_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10817-009-9143-8","volume":"43","author":"G. Sutcliffe","year":"2009","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure. The FOT and CNF parts, v.3.5.0. Journal of Automated Reasoning\u00a043(4), 337\u2013362 (2009)","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-61780-9_75","volume-title":"Types for Proofs and Programs","author":"T. Tammet","year":"1996","unstructured":"Tammet, T., Smith, J.M.: Optimized Encodings of Fragments of Type Theory in First Order Logic. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol.\u00a01158, pp. 265\u2013287. Springer, Heidelberg (1996)"},{"key":"7_CR28","unstructured":"The Agda development team: The Agda Wiki (2011), \n                  \n                    http:\/\/wiki.portal.chalmers.se\/agda"},{"key":"7_CR29","unstructured":"The Nuprl development team: PRL Project (2011), \n                  \n                    http:\/\/www.cs.cornell.edu\/info\/projects\/nuprl\/"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/15042.15053","volume":"21","author":"D. Turner","year":"1986","unstructured":"Turner, D.: An overview of Miranda. SIGPLAN Notices\u00a021, 158\u2013166 (1986)","journal-title":"SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:32Z","timestamp":1620126452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}