{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:29Z","timestamp":1759709069200,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00350-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:11:15Z","timestamp":1027577475000},"page":"177-195","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Towards the animation of proofs \u2013 testing proofs by examples"],"prefix":"10.1016","volume":"272","author":[{"given":"Susumu","family":"Hayashi","sequence":"first","affiliation":[]},{"given":"Ryosuke","family":"Sumitomo","sequence":"additional","affiliation":[]},{"given":"Ken-ichiro","family":"Shii","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00350-9_BIB1","doi-asserted-by":"crossref","unstructured":"S. Baratella, S. Berardi, Yet another constructivization of classical logic, in: G. Sambin, J. Smith (Eds.), Twenty-five years of Constructive Type Theory, Oxford University Press, Oxford, 1998,, pp. 1\u201320.","DOI":"10.1093\/oso\/9780198501275.003.0003"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB2","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1093\/logcom\/6.5.663","article-title":"Pruning simply typed lambda terms","volume":"5","author":"Berardi","year":"1996","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB3","doi-asserted-by":"crossref","unstructured":"U. Berger, H. Schwichtenberg, Program Extraction from Classical Proofs, Lecture Notes in Computer Science, vol. 960, Springer, Berlin, 1995, pp. 77\u201397.","DOI":"10.1007\/3-540-60178-3_80"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB4","unstructured":"Coq project: http:\/\/pauillac.inria.fr\/coq\/."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00243000","article-title":"The notion of proof in hardware verification","volume":"5","author":"Cohn","year":"1989","journal-title":"J. Automat. Reasoning"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB6","doi-asserted-by":"crossref","first-page":"755","DOI":"10.2307\/2275572","article-title":"A new deconstructive logic: linear logic","volume":"62","author":"Danos","year":"1997","journal-title":"J. Symbolic Logic"},{"year":"1994","series-title":"An Introduction to Formal Methods","author":"Diller","key":"10.1016\/S0304-3975(00)00350-9_BIB7"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB8","doi-asserted-by":"crossref","unstructured":"T.G. Griffin, A formulae-as-types notion of control, Conf. Record ACM Symp. on Principles of Programming Languages (990) 47\u201358.","DOI":"10.1145\/96709.96714"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB9","doi-asserted-by":"crossref","unstructured":"M. Hagiya, From Programming-by-Example to Proving-by-Example, Lecture Notes in Computer Science, vol. 526, Springer, Berlin, 1991, pp. 387\u2013419.","DOI":"10.1007\/3-540-54415-1_56"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB10","unstructured":"H. Harblin, A program from an a-translated impredicative proof of Higman's Lemma, Coq contributions, http:\/\/pauillac.inria.fr\/coq\/contribs\/summary.html."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB11","unstructured":"S. Hayashi, Constructive programming \u2013 a personal view-, in: D. S. Bridges, C. Calude, J. Gibbons, S. Reeves, I. Witten (Eds.), Combinatorics, Complexity, Logic, Springer, Singapore, 1996,, pp. 38\u201351."},{"year":"1988","series-title":"PX: A Computational Logic","author":"Hayashi","key":"10.1016\/S0304-3975(00)00350-9_BIB12"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB13","unstructured":"HOL system: http:\/\/www.cl.cam.ac.uk\/Research\/HVG\/HOL\/HOL.html."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1038\/scientificamerican1093-92","article-title":"The death of proof","volume":"269","author":"Horgan","year":"1993","journal-title":"Sci. Amer."},{"year":"1982","series-title":"Wittgenstein on Rules and Private Language","author":"Kripke","key":"10.1016\/S0304-3975(00)00350-9_BIB15"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB16","unstructured":"Mizar project: http:\/\/web.cs.ualberta.ca\/\u00a0\u0303piotr\/Mizar\/."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB17","doi-asserted-by":"crossref","unstructured":"I. Ogata, Cut Elimination for Classical Proofs as Continuation Passing Style Computation, Lecture Notes in Computer Science, vol. 1538, Springer, Berlin, 1998, pp. 61\u201378.","DOI":"10.1007\/3-540-49366-2_5"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB18","unstructured":"C. Parent, Ph.D. Thesis, L'Ecole Normale Sup\u00e9rieure de Lyon, January 1995."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB19","doi-asserted-by":"crossref","unstructured":"M. Parigot, \u03bb\u03bc-Calculus: an Algorithmic Interpretation of Classical Natural Deduction, Lecture Notes in Computer Science, vol. 624, Springer, Berlin, 1992, pp. 190\u2013201.","DOI":"10.1007\/BFb0013061"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB20","unstructured":"P. Rudnicki, A Mizar demo, http:\/\/www.cs.ualberta.ca\/\u00a0\u0303piotr\/Mizar\/Dagstuhl97\/."},{"year":"1994","series-title":"Metamathematics, Machines, and G\u00f6del's Proof","author":"Shankar","key":"10.1016\/S0304-3975(00)00350-9_BIB21"},{"key":"10.1016\/S0304-3975(00)00350-9_BIB22","unstructured":"K. Shii, Optimizations in constructive programming, Masters Thesis, Graduate School of Science and Technology, Kobe University, 1996 (in Japanese)."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB23","unstructured":"R. Sumitomo, Proofworks: An environment for animation of proofs, Masters Thesis, Graduate School of Science and Technology, Kobe University, 1997."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB24","unstructured":"N. Tamura, A Linear Logic Prover (llprover), http:\/\/bach.seg.kobe-u.ac.jp\/llprover\/."},{"key":"10.1016\/S0304-3975(00)00350-9_BIB25","unstructured":"N. Tamura, LLP: a linear logic programming language and its compiler system, http:\/\/bach.seg.kobe-u.ac.jp\/llp\/."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003509?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003509?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:16Z","timestamp":1759625536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003509"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00350-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards the animation of proofs \u2013 testing proofs by examples","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00350-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}