{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300245},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580850"},{"type":"electronic","value":"9783540484400"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:21Z","timestamp":1330251081000},"page":"291-312","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Developing certified programs in the system Coq the program tactic"],"prefix":"10.1007","author":[{"given":"C.","family":"Parent","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","unstructured":"H. Barendregt. Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen, September 1991."},{"key":"13_CR2","unstructured":"R. Burstall and J. McKinna. Deliverables: a categorical approach to program development in type theory. Technical Report 92-242, LFCS, October 1992. Also in [NPP92]."},{"key":"13_CR3","unstructured":"R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986."},{"key":"13_CR4","unstructured":"G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq Proof Assistant User's Guide \u2014 Version 58. Technical Report 154, Projet Formel \u2014 INRIA-Rocquencourt-CNRS-ENS Lyon, May 1993."},{"key":"13_CR5","unstructured":"G. Dowek. D\u00e9monstration Automatique dans le Calcul des Constructions. PhD thesis, Universit\u00e9 Paris 7, 1991."},{"key":"13_CR6","unstructured":"G. Dowek. A Complete Proof Synthesis Method for the Cube of Type Systems. Journal of Logic and Computation, To appear."},{"key":"13_CR7","unstructured":"S. Hayashi and H. Nakano. PX: A Computational Logic. Foundations of Computing. MIT Press, 1988."},{"key":"13_CR8","unstructured":"W.A. Howard, The formulaes-as-types notion of construction. In J.R. Hindley, editor, To H.B. Curry: Essays on Combinatory Logic, lambda-calculus and formalism. Seldin, J.P., 1980."},{"key":"13_CR9","unstructured":"Z. Luo. An Extended Calculus of Constructions. PhD thesis, Department of Computer Science, University of Edinburgh, June 1990."},{"key":"13_CR10","unstructured":"P. Manoury and M. Simonot. Des preuves de totalit\u00e9 de fonctions comme synth\u00e8se de programmes. PhD thesis, Universit\u00e9 PARIS 7, December 1992."},{"key":"13_CR11","unstructured":"B. Nordstr\u00f6m, K. Petersson, and G. Plotkinn, editors. Prooceedings of the 1992 worshop on types for proofs and programs, June 1992."},{"key":"13_CR12","unstructured":"C. Parent. Automatisation partielle du d\u00e9veloppement de programmes dans le syst\u00e8me Coq. Master's thesis, Ecole Normale Sup\u00e9rieure de Lyon, June 1992."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"C. Paulin-Mohring. Extracting F\u03c9's programs from proofs in the Calculus of Constructions. In Association for Computing Machinery, editor, Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, January 1989.","DOI":"10.1145\/75277.75285"},{"key":"13_CR14","unstructured":"C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. PhD thesis, Universit\u00e9 Paris VII, 1989."},{"key":"13_CR15","unstructured":"C. Paulin-Mohring. Inductive Definitions in the System Coq \u2014 Rules and Properties. In Typed Lambda Calculi and Applications, volume 664 of LNCS, March 1993. Also in research report 92-49, LIP-ENS Lyon, December 1992."},{"key":"13_CR16","unstructured":"C. Paulin-Mohring and B. Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation-special issue on automated programing, 1992. To appear."},{"key":"13_CR17","unstructured":"E. Poll. A programming logic for F\u03c9. Technical Report 92\/25, Eindhoven University of Technology, September 1992."}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58085-9_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:42:16Z","timestamp":1558255336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58085-9_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}