{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:50:36Z","timestamp":1725742236653},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396335"},{"type":"electronic","value":"9783642396342"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39634-2_35","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T09:52:36Z","timestamp":1374486756000},"page":"469-476","source":"Crossref","is-referenced-by-count":0,"title":["Stateless Higher-Order Logic with Quantified Types"],"prefix":"10.1007","author":[{"given":"Evan","family":"Austin","sequence":"first","affiliation":[]},{"given":"Perry","family":"Alexander","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Austin, E., Alexander, P.: HaskHOL: A Haskell Hosted Domain Specific Language Representation of HOL Light. In: Trends in Functional Programming Draft Proceedings (2010)"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A. Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A Brief Overview of Agda \u2013 A Functional Language with Dependent Types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 73\u201378. Springer, Heidelberg (2009)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Coquand, T.: A New Paradox in Type Theory. In: Logic, Methodology and Philosophy of Science IX: Proceedings of the Ninth International Congress of Logic, Methodology, and Philosophy of Science, pp. 7\u201314. Elsevier (1994)","DOI":"10.1016\/S0049-237X(06)80062-5"},{"key":"35_CR4","unstructured":"Gordon, M.: Why Higher-Order Logic is a Good Formalism for Specifying and Verifying Hardware, North-Holland (1986)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Haftmann, F.: From Higher-Order Logic to Haskell: There and Back Again. In: Gallagher, J.P., Voigtl\u00e4nder, J. (eds.) Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2010, Madrid, Spain, January 18-19. ACM (2010)","DOI":"10.1145\/1706356.1706385"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0031814","volume-title":"Formal Methods in Computer-Aided Design","author":"J. Harrison","year":"1996","unstructured":"Harrison, J.: HOL Light: A Tutorial Introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol.\u00a01166, pp. 265\u2013269. Springer, Heidelberg (1996)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-03359-9_18","volume-title":"Theorem Proving in Higher Order Logics","author":"P.V. Homeier","year":"2009","unstructured":"Homeier, P.V.: The HOL-Omega Logic. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 244\u2013259. Springer, Heidelberg (2009)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Huffman, B.: Formal Verification of Monad Transformers. In: Thiemann, P., Findler, R.B. (eds.) ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, Copenhagen, Denmark, September 9-15, pp. 15\u201316. ACM (2012)","DOI":"10.1145\/2398856.2364532"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1596550.1596566","volume-title":"Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming, ICFP 2009","author":"G. Klein","year":"2009","unstructured":"Klein, G., Derrin, P., Elphinstone, K.: Experience Report: SEL4: Formally Verifying a High-Performance Microkernel. In: Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming, ICFP 2009, pp. 91\u201396. ACM, New York (2009)"},{"key":"35_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569845","volume-title":"Higher Order Logic and Hardware Verification","author":"T. Melham","year":"1993","unstructured":"Melham, T.: Higher Order Logic and Hardware Verification. Cambridge University Press, New York (1993)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Procter, A., Harrison, W.L., Stump, A.: The Design of a Practical Proof Checker for a Lazy Functional Language. In: Trends in Functional Programming Draft Proceedings (2012)","DOI":"10.1007\/978-3-642-40447-4_8"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-71067-7_6","volume-title":"Theorem Proving in Higher Order Logics","author":"K. Slind","year":"2008","unstructured":"Slind, K., Norrish, M.: A Brief Overview of HOL4. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 28\u201332. Springer, Heidelberg (2008)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-74591-4_25","volume-title":"Theorem Proving in Higher Order Logics","author":"N. V\u00f6lker","year":"2007","unstructured":"V\u00f6lker, N.: HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 334\u2013351. Springer, Heidelberg (2007)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Wiedijk, F.: Stateless HOL. In: Hirschowitz, T. (ed.) Proceedings Types for Proofs and Programs, Revised Selected Papers. EPTCS, vol.\u00a053, pp. 47\u201361 (2009)","DOI":"10.4204\/EPTCS.53.4"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Yorgey, B.A., Weirich, S., Cretin, J., Jones, S.L.P., Vytiniotis, D., Magalh\u00e3es, J.P.: Giving Haskell a Promotion. In: Pierce, B.C. (ed.) Proceedings of TLDI 2012: The Seventh ACM SIGPLAN Workshop on Types in Languages Design and Implementation, Philadelphia, PA, USA, January 28, pp. 53\u201366. ACM (2012)","DOI":"10.1145\/2103786.2103795"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39634-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:50:21Z","timestamp":1558302621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39634-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396335","9783642396342"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39634-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}