{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:10Z","timestamp":1725489490648},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427520"},{"type":"electronic","value":"9783540455042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45504-3_2","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T22:56:02Z","timestamp":1187045762000},"page":"22-37","source":"Crossref","is-referenced-by-count":10,"title":["Reflective \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Jesse","family":"Alt","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Artemov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"2_CR1","unstructured":"S. Artemov, \u201cOperational Modal Logic,\u201d Tech. Rep. MSI 95-29, Cornell University, December 1995 http:\/\/www.cs.cornell.edu\/Info\/People\/artemov\/MSI95-29.ps"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"S. Artemov, \u201cUniform provability realization of intuitionistic logic, modality and lambda-terms\u201d, Electronic Notes on Theoretical Computer Science, vol. 23, No. 1. 1999 http:\/\/www.elsevier.nl\/entcs","DOI":"10.1016\/S1571-0661(04)00100-8"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S. Artemov","year":"2001","unstructured":"S. Artemov, \u201cExplicit provability and constructive semantics\u201d, The Bulletin for Symbolic Logic, v.7, No. 1, pp. 1\u201336, 2001 http:\/\/www.cs.cornell.edu\/Info\/People\/artemov\/BSL.ps .","journal-title":"Bulletin for Symbolic Logic"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"H. Barendregt, \u201cLambda calculi with types\u201d. In Handbook of Logic in Computer Science, vol.2, Abramsky, Gabbay, and Maibaum, eds., Oxford University Press, pp. 118\u2013309, 1992","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"R. Constable, \u201cTypes in logic, mathematics and programming\u201d. In Handbook in Proof Theory, S. Buss, ed., Elsevier, pp. 683\u2013786, 1998","DOI":"10.1016\/S0049-237X(98)80025-6"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"D. de Jongh and G. Japaridze, \u201cLogic of Provability\u201d, in S. Buss, ed., Handbook of Proof Theory, Elsevier, pp. 475\u2013546, 1998","DOI":"10.1016\/S0049-237X(98)80022-0"},{"key":"2_CR7","unstructured":".J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge University Press, 1989."},{"key":"2_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-63045-7_18","volume-title":"Operational Logic of Proofs with Functionality Condition on Proof Predicate","author":"V.N. Krupski","year":"1997","unstructured":"V.N. Krupski, \u201cOperational Logic of Proofs with Functionality Condition on Proof Predicate\u201d, Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science\u2019 97, Yaroslavl\u2019, pp. 167\u2013177, 1997"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"V.N. Krupski, \u201cThe single-conclusion proof logic and inference rules specification\u201d, Annals of Pure and Applied Logic, v.110, No. 1-3, 2001 (to appear).","DOI":"10.1016\/S0168-0072(01)00058-6"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"A. Nerode, \u201cApplied Logic\u201d. In The merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, R.E. Ewing, K.I. Gross, C.F. Martin, eds., Springer-Verlag, pp. 127\u2013164, 1986","DOI":"10.1007\/978-1-4612-4984-9_10"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A. Troelstra, \u201cRealizability\u201d. In Handbook in Proof Theory, S. Buss, ed., Elsevier, pp. 407\u2013474, 1998","DOI":"10.1016\/S0049-237X(98)80021-9"},{"key":"2_CR12","unstructured":"A.S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996."}],"container-title":["Lecture Notes in Computer Science","Proof Theory in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45504-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:57:20Z","timestamp":1708167440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45504-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427520","9783540455042"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45504-3_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}