{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:49:03Z","timestamp":1773193743424,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642253782","type":"print"},{"value":"9783642253799","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25379-9_11","type":"book-chapter","created":{"date-parts":[[2011,11,13]],"date-time":"2011-11-13T20:33:47Z","timestamp":1321216427000},"page":"119-134","source":"Crossref","is-referenced-by-count":26,"title":["A Decision Procedure for Regular Expression Equivalence in Type Theory"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Siles","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-18098-9_7","volume-title":"Implementation and Application of Automata","author":"J.B. Almeida","year":"2011","unstructured":"Almeida, J.B., Moreira, N., Pereira, D., de Sousa, S.M.: Partial Derivative Automata Formalized in Coq. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 59\u201368. Springer, Heidelberg (2011)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bezem, M., Nakata, K., Uustalu, T.: On streams that are finitely red (submitted, 2011)","DOI":"10.2168\/LMCS-8(4:4)2012"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Braibant, T., Pous, D.: A tactic for deciding Kleene algebras. In: First Coq Workshop (August 2009)","DOI":"10.1007\/978-3-642-14052-5_13"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-14052-5_13","volume-title":"Interactive Theorem Proving","author":"T. Braibant","year":"2010","unstructured":"Braibant, T., Pous, D.: An Efficient Coq Tactic for Deciding Kleene Algebras. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 163\u2013178. Springer, Heidelberg (2010)"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. JACM\u00a011(4), 481\u2013494 (1964)","journal-title":"JACM"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second order arithmetica and finite automata. Zeitscrift Fur Mathematische Logic und Grundlagen Der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitscrift Fur Mathematische Logic und Grundlagen Der Mathematik"},{"key":"11_CR7","unstructured":"The Coq Development Team, http:\/\/coq.inria.fr"},{"key":"11_CR8","unstructured":"Coquand, T., Gonthier, G., Siles, V.: Source code of the formalization, http:\/\/www.cse.chalmers.se\/~siles\/coq\/regexp.tar.bzip2"},{"key":"11_CR9","unstructured":"Coquand, T., Spiwack, A.: Constructively finite? In: Laureano Lamb\u00e1n, L., Romero, A., Rubio, J. (eds.) Scientific Contributions in Honor of Mirian Andr\u00e9s G\u00f3mez Servicio de Publicaciones, Universidad de La rioja, Spain (2010)"},{"key":"11_CR10","unstructured":"Johnstone, P.: Topos theory. Academic Press (1977)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Krauss, A., Nipkow, T.: Proof Pearl: Regular Expression Equivalence and Relation Algebra. Journal of Automated Reasoning (March 2011) (published online)","DOI":"10.1007\/s10817-011-9223-4"},{"key":"11_CR12","first-page":"73","volume-title":"Logic Colloquium 1973","author":"P. Martin-L\u00f6f","year":"1973","unstructured":"Martin-L\u00f6f, P.: An intuitionistic type theory: predicative part. In: Logic Colloquium 1973, pp. 73\u2013118. North-Holland, Amsterdam (1973)"},{"key":"11_CR13","first-page":"51","volume":"5","author":"B.G. Mirkin","year":"1996","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics\u00a05, 51\u201357 (1996)","journal-title":"Engineering Cybernetics"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Nordstr\u00f6m, B.: Terminating general recursion BIT, vol.\u00a028, pp. 605\u2013619 (1988)","DOI":"10.1007\/BF01941137"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression Derivatives Re-examined. Journal of Functional Programming\u00a019(2), 173\u2013190","DOI":"10.1017\/S0956796808007090"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/aima.1993.1004","volume":"97","author":"F. Richman","year":"1993","unstructured":"Richman, F., Stolzenberg, G.: Well-Quasi-Ordered sets. Advances in Mathematics\u00a097, 145\u2013153 (1993)","journal-title":"Advances in Mathematics"},{"key":"11_CR17","unstructured":"Russell, B., Whitehead, A.N.: Principia Mathematica. Cambridge University Press (1910)"},{"issue":"2","key":"11_CR18","first-page":"95","volume":"3","author":"G. Gonthier","year":"2010","unstructured":"Gonthier, G., Mahboubi, A.: An introduction to small scale reflection in Coq. Journal of Formalized Reasoning\u00a03(2), 95\u2013152 (2010)","journal-title":"Journal of Formalized Reasoning"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-6-1-45-95","volume":"6","author":"A. Tarski","year":"1924","unstructured":"Tarski, A.: Sur les ensembles finis. Fundamenta Mathematicae\u00a06, 45\u201395 (1924)","journal-title":"Fundamenta Mathematicae"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-03359-9_31","volume-title":"Theorem Proving in Higher Order Logics","author":"R. Thiemann","year":"2009","unstructured":"Thiemann, R., Sternagel, C.: Certification of Termination Proofs Using CeTA. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 452\u2013468. Springer, Heidelberg (2009)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-22863-6_25","volume-title":"Interactive Theorem Proving","author":"C. Wu","year":"2011","unstructured":"Wu, C., Zhang, X., Urban, C.: A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl). In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol.\u00a06898, pp. 341\u2013356. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25379-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T09:39:06Z","timestamp":1560937146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25379-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642253782","9783642253799"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25379-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}