{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:55:56Z","timestamp":1725562556318},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221647"},{"type":"electronic","value":"9783540248491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24849-1_4","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:34:24Z","timestamp":1281299664000},"page":"51-65","source":"Crossref","is-referenced-by-count":1,"title":["Introduction to PAF!, a Proof Assistant for ML Programs Verification"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Baro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Baro, S.: Conception et impl\u00e9mentation d\u2019un syst\u00e8me d\u2019aide \u00e0 la sp\u00e9cification et \u00e0 la preuve de programmes ML. PhD Universit\u00e9 Denis Diderot (2003)"},{"key":"4_CR2","unstructured":"Baro, S., Manoury, P.: Un syst\u00e8me X. Raisonner formellement sur les programmes ML. Journ\u00e9es Francophones des Langages Applicatifs, INRIA (2003)"},{"key":"4_CR3","volume-title":"A Computational Logic","author":"R. Boyer","year":"1979","unstructured":"Boyer, R., Strother Moore, J.: A Computational Logic. Academic Press, London (1979)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cl\u00e9ment, D., Despeyroux, J., Despeyroux, T., Kahn, G.: A Simple Applicative Language: Mini-ML. In: Proceedings of ACM Symposium on LISP and Functional Programming (1986)","DOI":"10.1145\/319838.319847"},{"key":"4_CR5","unstructured":"Catarina Coquand. Agda, 2000. http:\/\/www.cs.chalmers.se\/~catarina\/agda\/"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Filli\u00e2tre, J.-C.: Why: a multi-language multi-prover verification tool. Submitted to FME 2003 (March 2003)","DOI":"10.1007\/978-3-540-30482-1_10"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF: A mechanised logic of computation.","author":"M.J. Gordon","year":"1979","unstructured":"Gordon, M.J., Milner, R., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol.\u00a078. Springer, Heidelberg (1979)"},{"key":"4_CR8","unstructured":"Hallgren, T.: Alfa (2001), http:\/\/www.cs.chalmers.se\/~hallgren\/Alfa\/"},{"key":"4_CR9","unstructured":"Kaufmann, M., Moore, J.S.: A Precise Description of the ACL2 Logic. Technical report, Computational Logic, Inc. (1997)"},{"key":"4_CR10","unstructured":"Krivine, J.-L.: Lambda-Calculus, Types and Models. Ellis and Horwood (1993)"},{"key":"4_CR11","unstructured":"Legrandg\u00e9rard, Y.: Proof Engine Protocol, version 2 specification (manuscript)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Reasoning about functional programs and complexity classes associated with type discipline. Foundations of Computer Science (1983)","DOI":"10.1109\/SFCS.1983.50"},{"key":"4_CR13","unstructured":"Martin-L\u00f6f, P.: Intuitionistic Type Theory. Studies in Proof Theory. Bibliopolis (1984)"},{"key":"4_CR14","unstructured":"Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS System Guide. SRI International, v2.4 edition (2001), http:\/\/pvs.csl.sri.com"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Types for Proofs and Programs","author":"C. Parent","year":"1994","unstructured":"Parent, C.: Developing certified programs in the system Coq - the Program tactic. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806, Springer, Heidelberg (1994)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Parigot, M.: Recursive programming with proofs. Theoretical Computer Science, 335\u2013356 (1992)","DOI":"10.1016\/0304-3975(92)90042-E"},{"key":"4_CR17","unstructured":"Parigot, M.: Church-Rosser property in classical free deduction. In: Huet, G., Plotkin, G. (eds.) Logical Environments (1993)"},{"key":"4_CR18","unstructured":"LogiCal Project The Coq Development Team. The Coq Proof Assistant Reference Manual. INRIA, 1999-2001. v7.2, http:\/\/coq.inria.fr"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24849-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T02:05:26Z","timestamp":1635991526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24849-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221647","9783540248491"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24849-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}