{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:36Z","timestamp":1725565416177},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_10","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T21:32:53Z","timestamp":1284154373000},"page":"134-154","source":"Crossref","is-referenced-by-count":5,"title":["Rewriting for Fitch Style Natural Deductions"],"prefix":"10.1007","author":[{"given":"Herman","family":"Geuvers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Nederpelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Barendregt, H.P.: Lambda calculi with Types. In: Abramski, et al. (eds.) Handbook of Logic in Computer Science, pp. 117\u2013309. Oxford Univ. Press, Abramski et al."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/comjnl\/42.3.177","volume":"42","author":"R. Bornat","year":"1999","unstructured":"Bornat, R., Sufrin, B.: Animating Formal Proof at the Surface: The Jape Proof Calculator. The Computer Journal\u00a042(3), 177\u2013192 (1999)","journal-title":"The Computer Journal"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(94)90012-4","volume":"126","author":"L. Regnier","year":"1994","unstructured":"Regnier, L.: Une \u00e9quivalence sur les lambda-termes. TCS\u00a0126(2), 281\u2013292 (1994)","journal-title":"TCS"},{"key":"10_CR4","volume-title":"Symbolic Logic","author":"F.B. Fitch","year":"1952","unstructured":"Fitch, F.B.: Symbolic Logic. The Ronald Press Company, New York (1952)"},{"key":"10_CR5","volume-title":"Collected Works. Edited by M.E. Szabo.","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Collected Works. Edited by M.E. Szabo. North-Holland, Amsterdam (1969)"},{"key":"10_CR6","first-page":"479","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"W.H. Howard","year":"1980","unstructured":"Howard, W.H.: The formulas-as-types notion of construction. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"10_CR7","volume-title":"Natural Deduction","author":"D. Prawitz","year":"1965","unstructured":"Prawitz, D.: Natural Deduction. Almquist & Wiksell, Stockholm (1965)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T15:13:41Z","timestamp":1548429221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}