{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:22Z","timestamp":1749125182667},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605799"},{"type":"electronic","value":"9783540477709"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60579-7_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:42:49Z","timestamp":1330288969000},"page":"183-202","source":"Crossref","is-referenced-by-count":4,"title":["Formalization of a \u03bb-calculus with explicit substitutions in Coq"],"prefix":"10.1007","author":[{"given":"Amokrane","family":"Sa\u00efbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","unstructured":"T. Altenkirch, A formalization of the strong normalization proof for System F in LEGO, In Proceedings of the international conference on Typed Lambda Calculi and Applications, TLCA'93, Springer-Verlag, LNCS 664, March 1993."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, J.-J. L\u00e9vy, Explicit Substitutions, ACM Conference on Principle of Programming Languages, San Francisco, 1990.","DOI":"10.1145\/96709.96712"},{"key":"10_CR3","unstructured":"T. Coquand, Une th\u00e9orie des constructions, Th\u00e8se de troisi\u00e8me cycle. Universit\u00e9 Paris 7. 1985"},{"key":"10_CR4","unstructured":"C. Cornes Inversion des pr\u00e9dicats inductifs, Rapport de stage de DEA d'Informatique Fondamentale, Universit\u00e9 Paris VII, septembre 93."},{"key":"10_CR5","unstructured":"P.-L. Curien, T. Hardin, J.-J. L\u00e9vy, Confluence properties of Weak and Strong Calculi of Explicit Substitutions, Rapport de recherche CEDRIC 92-1, 56 pages."},{"key":"10_CR6","unstructured":"G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, B. Werner, The Coq Proof Assistant User's Guide, version 5.8, Rapport technique INRIA 154, Mai 1993."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"T. Hardin, Eta-conversion for the languages of explicit substitutions, Applicable Algebra in Engineering, Communication and Computing, 1993.","DOI":"10.1007\/BF01188746"},{"key":"10_CR8","unstructured":"T. Hardin, J.-J. L\u00e9vy, A Confluent Calculus of Substitutions, France-Japan Artificial Intelligence and Computer Science Symposium, Izu, 1989. Rapport de recherche CEDRIC 90\/11."},{"issue":"4","key":"10_CR9","first-page":"797","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,J.A.C.M., vol 27(4), pp 797\u2013821, October 1980.","journal-title":"J.A.C.M."},{"key":"10_CR10","unstructured":"G. Huet, Inductive Principles Formalized in the Calculus of Constructions, Proceeding of the First Franco-Japanese Symposium on Programming of Future Generation Computers, Tokyo, October 88."},{"key":"10_CR11","unstructured":"G. Huet, Residual Theory in \u03bb-calculus: A complete Gallina Development, Rapport de recherche INRIA 2002, 1993."},{"key":"10_CR12","unstructured":"J. McKinna and R. Pollack, Pure Type Systems Formalized, In Proceedings of the international conference on Typed Lambda Calculi and Applications, TLCA'93, Springer-Verlag, LNCS 664, March 1993."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"C. Paulin-Mohring, Inductive Definitions in the System Coq-Rules and Properties, Proceedings TLCA 93, Ultrecht, March 93. LNCS 664, p 328\u2013345.","DOI":"10.1007\/BFb0037116"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"H. Yokouchi, Relationship between \u03bb-calculus and Rewriting Systems for Categorical Combinators, Theoretical Computer Sc. 65, 1989.","DOI":"10.1016\/0304-3975(89)90104-7"}],"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-60579-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:53Z","timestamp":1605646793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60579-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605799","9783540477709"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60579-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}