{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:17Z","timestamp":1750307657414,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,8]],"date-time":"2009-03-08T00:00:00Z","timestamp":1236470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,8]]},"DOI":"10.1145\/1529282.1529527","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"1110-1115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Formalizing Desargues' theorem in Coq using ranks"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Magaud","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Strasbourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Narboux","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Strasbourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schreck","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Strasbourg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Coq'Art: The Calculus of Inductive Constructions","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran . Interactive Theorem Proving and Program Development , Coq'Art: The Calculus of Inductive Constructions . Springer , 2004 . Y. Bertot and P. Cast\u00e9ran. Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions. Springer, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9086-x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11576280_28"},{"key":"e_1_3_2_1_4_1","volume-title":"North Holland","author":"Buekenhout F.","year":"1995","unstructured":"F. Buekenhout , editor. Handbook of Incidence Geometry . North Holland , 1995 . F. Buekenhout, editor. Handbook of Incidence Geometry. North Holland, 1995."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/2196"},{"volume-title":"LogiCal Project","year":"2008","key":"e_1_3_2_1_6_1","unstructured":"Coq development team. The Coq Proof Assistant Reference Manual, Version 8.2 . LogiCal Project , 2008 . Coq development team. The Coq Proof Assistant Reference Manual, Version 8.2. LogiCal Project, 2008."},{"key":"e_1_3_2_1_7_1","unstructured":"H. S. M. Coxeter. Projective Geometry. Springer 1987.  H. S. M. Coxeter. Projective Geometry . Springer 1987."},{"key":"e_1_3_2_1_8_1","series-title":"LNAI","first-page":"306","volume-title":"ADG'00","author":"Dehlinger C.","year":"2000","unstructured":"C. Dehlinger , J.-F. Dufourd , and P. Schreck . Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry . In ADG'00 , volume 2061 of LNAI , pages 306 -- 324 . Springer-Verlag , 2000 . C. Dehlinger, J.-F. Dufourd, and P. Schreck. Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry. In ADG'00, volume 2061 of LNAI, pages 306--324. Springer-Verlag, 2000."},{"key":"e_1_3_2_1_9_1","first-page":"370","volume-title":"Functors for Proofs and Programs. In ESOP'2004","volume":"2986","author":"Filli\u00e2tre J.-C.","year":"2004","unstructured":"J.-C. Filli\u00e2tre and P. Letouzey . Functors for Proofs and Programs. In ESOP'2004 , volume 2986 of LNCS, pages 370 -- 384 . Springer-Verlag , 2004 . J.-C. Filli\u00e2tre and P. Letouzey. Functors for Proofs and Programs. In ESOP'2004, volume 2986 of LNCS, pages 370--384. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3166\/tsi.24.1113-1138"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/B978-044451104-1\/50022-8","volume-title":"Handbook of Computer Aided Geometric Design","author":"Hoffmann C. M.","year":"2002","unstructured":"C. M. Hoffmann and R. Joan-Arinyo . Handbook of Computer Aided Geometric Design , chapter Parametric Modeling, pages 519 -- 541 . Elsevier , 2002 . C. M. Hoffmann and R. Joan-Arinyo. Handbook of Computer Aided Geometric Design, chapter Parametric Modeling, pages 519--541. Elsevier, 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195906002105"},{"key":"e_1_3_2_1_13_1","first-page":"2","article-title":"Desargues theorem in projective 3-space","author":"Kusak E.","year":"1990","unstructured":"E. Kusak . Desargues theorem in projective 3-space . J. of Formalized Mathematics , 2 , 1990 . E. Kusak. Desargues theorem in projective 3-space. J. of Formalized Mathematics, 2, 1990.","journal-title":"J. of Formalized Mathematics"},{"key":"e_1_3_2_1_14_1","volume-title":"September","author":"Magaud N.","year":"2008","unstructured":"N. Magaud , J. Narboux , and P. Schreck . Formalizing Projective Plane Geometry in Coq. accepted for presentation at ADG'08 , September 2008 . N. Magaud, J. Narboux, and P. Schreck. Formalizing Projective Plane Geometry in Coq. accepted for presentation at ADG'08, September 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/10930755_21"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1128888.1128915"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195906002130"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"225","volume-title":"TPHOLs'04","author":"Narboux J.","year":"2004","unstructured":"J. Narboux . A decision procedure for geometry in Coq . In TPHOLs'04 , volume 3223 of LNCS , pages 225 -- 240 . Springer-Verlag , 2004 . J. Narboux. A decision procedure for geometry in Coq. In TPHOLs'04, volume 3223 of LNCS, pages 225--240. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_19_1","series-title":"LNAI","first-page":"139","volume-title":"ADG'06","author":"Narboux J.","year":"2007","unstructured":"J. Narboux . Mechanical theorem proving in Tarski's geometry . In ADG'06 , volume 4869 of LNAI , pages 139 -- 156 . Springer-Verlag , 2007 . J. Narboux. Mechanical theorem proving in Tarski's geometry. In ADG'06, volume 4869 of LNAI, pages 139--156. Springer-Verlag, 2007."},{"key":"e_1_3_2_1_20_1","first-page":"111","volume-title":"Robustness in CAD Geometric Construction. In IV'01","author":"Schreck P.","year":"2001","unstructured":"P. Schreck . Robustness in CAD Geometric Construction. In IV'01 , pages 111 -- 116 , London , 2001 . P. Schreck. Robustness in CAD Geometric Construction. In IV'01, pages 111--116, London, 2001."}],"event":{"name":"SAC09: The 2009 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Honolulu Hawaii","acronym":"SAC09"},"container-title":["Proceedings of the 2009 ACM symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529527","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1529282.1529527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:25Z","timestamp":1750253365000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,8]]},"references-count":20,"alternative-id":["10.1145\/1529282.1529527","10.1145\/1529282"],"URL":"https:\/\/doi.org\/10.1145\/1529282.1529527","relation":{},"subject":[],"published":{"date-parts":[[2009,3,8]]},"assertion":[{"value":"2009-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}