{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:03Z","timestamp":1725664263358},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580850"},{"type":"electronic","value":"9783540484400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:25Z","timestamp":1330251085000},"page":"333-351","source":"Crossref","is-referenced-by-count":2,"title":["Machine Deduction"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Raffalli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984."},{"key":"15_CR2","unstructured":"M. Felleisen and D. Friedman. Control operators, the SECD machine and the \u03bb-calculus. In Formal Description of Programming Concepts III, pages 131\u2013141. North-Holland, 1986."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","volume":"45","author":"J.-Y. Girard","year":"1986","unstructured":"J.-Y. Girard. The system F of variable types: fifteen years later. Theoretical Computer Science, 45:159\u2013192, 1986.","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","unstructured":"W. Howard. The formulae-as-types notion of construction. To H.B. Curry: Essays on combinatory logic, \u03bb-calculus and formalism, pages 479\u2013490, 1980."},{"key":"15_CR5","unstructured":"Jean-Louis Krivine. Lambda-Calcul: Types et Mod\u00e8les. Etudes et Recherches en Informatique. Masson, 1990."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01792986","volume":"30","author":"J. Krivine","year":"1990","unstructured":"Jean-Louis Krivine. Oprateurs de mise en mmoire et traduction de g\u00f6del. Archive for Mathematical Logic, 30:241\u2013267, 1990.","journal-title":"Archive for Mathematical Logic"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Jean-Louis Krivine. Classical logic, storage operators and second order \u03bb-calculus. to appear in APAL 1994, 1992.","DOI":"10.1016\/0168-0072(94)90047-7"},{"issue":"3","key":"15_CR8","first-page":"149","volume":"26","author":"J. Krivine","year":"1990","unstructured":"Jean-Louis Krivine and Michel Parigot. Programming with proofs. Inf. Process. Cybern., EIK 26(3):149\u2013167, 1990.","journal-title":"Inf. Process. Cybern., EIK"},{"key":"15_CR9","first-page":"51","volume":"44","author":"D. Leivant","year":"1986","unstructured":"Daniel Leivant. Typing and computational properties of lambda expressions. The-oretical Computer Science, 44:51\u201368, 1986.","journal-title":"The-oretical Computer Science"},{"key":"15_CR10","unstructured":"Xavier Leroy. The ZINC experiement: an economical implementation of the ML language. Technical report, INRIA, 1990."},{"key":"15_CR11","unstructured":"Chetan R. Murthy. Finding the answers in classical proofs: A unifying framework. In Logical Environment, pages 247\u2013272. Cambridge University Press, 1992."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Michel Parigot. Programming with proofs: a second order type theory. Lecture Notes in Computer Science, 300, 1988. Communication at ESOP 88.","DOI":"10.1007\/3-540-19027-9_10"},{"key":"15_CR13","first-page":"190","volume-title":"volume 624 of Lecture Notes in Computer Science","author":"M. Parigot","year":"1991","unstructured":"Michel Parigot. \u03bb\u03bc-calculus an algorithmic interpretation of classical natural deduction. In Proc of Log. and Automatic Reasoning, volume 624 of Lecture Notes in Computer Science, pages 190\u2013201, St Petersbourg, 1991. Springer Verlag."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(92)90042-E","volume":"94","author":"M. Parigot","year":"1992","unstructured":"Michel Parigot. Recursive programming with proofs. Theoritical Computer Science, 94:335\u2013356, 1992.","journal-title":"Theoritical Computer Science"},{"key":"15_CR15","unstructured":"Simon L. Peyton J. The Implementation of Functional Programming Languages. Prentice-Hall, 1987. Prentice-Hall International Series in Computer Science."}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58085-9_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:52Z","timestamp":1605629812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58085-9_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}