Some considerations on the usability of interactive provers
In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to anal...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 156 |
|---|---|
| container_issue | |
| container_start_page | 147 |
| container_title | |
| container_volume | |
| creator | Asperti, Andrea Coen, Claudio Sacerdoti |
| description | In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions. |
| doi_str_mv | 10.5555/1894483.1894498 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>acm</sourceid><recordid>TN_cdi_acm_books_10_5555_1894483_1894498</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>acm_books_10_5555_1894483_1894498</sourcerecordid><originalsourceid>FETCH-LOGICAL-a157t-9100ab29fafb4c7f40b43c79715a52deb826f0b673991f8ba991f61c71434fd43</originalsourceid><addsrcrecordid>eNqNj01LxDAURQMiKGPXbrN005o0L02CKxn8GBhwoa5DkiYYnWmkiQP-ezPaH-DdnAf38uAgdElJx2uuqVQAknW_VPIENUpINkBPgfaCnKEm53dSAzBwrs7RzXPae-zSlOPoZ1NivXCacHnz-CsbG3exfOMUcJxK7V2JB48_53Twc75Ap8Hssm8WrtDr_d3L-rHdPj1s1rfb1lAuSqsoIcb2KphgwYkAxAJzQgnKDe9Hb2U_BGIHwZSiQVpzxECdoMAgjMBW6Orvr3F7bVP6yJoSffTVi69efOu0--dU2zn6wH4AfGVWgw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Some considerations on the usability of interactive provers</title><source>Springer Books</source><creator>Asperti, Andrea ; Coen, Claudio Sacerdoti</creator><contributor>Rideau, Laurence ; Calmet, Jacques ; Rioboo, Renaud ; Ion, Patrick D. F. ; Sexton, Alan P. ; Autexier, Serge ; Delahaye, David</contributor><creatorcontrib>Asperti, Andrea ; Coen, Claudio Sacerdoti ; Rideau, Laurence ; Calmet, Jacques ; Rioboo, Renaud ; Ion, Patrick D. F. ; Sexton, Alan P. ; Autexier, Serge ; Delahaye, David</creatorcontrib><description>In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions.</description><identifier>ISBN: 9783642141270</identifier><identifier>ISBN: 3642141277</identifier><identifier>DOI: 10.5555/1894483.1894498</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer-Verlag</publisher><subject>Computing methodologies ; Computing methodologies -- Symbolic and algebraic manipulation ; Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms ; Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Theorem proving algorithms ; Mathematics of computing ; Mathematics of computing -- Continuous mathematics ; Mathematics of computing -- Continuous mathematics -- Calculus ; Mathematics of computing -- Continuous mathematics -- Calculus -- Lambda calculus ; Theory of computation ; Theory of computation -- Logic ; Theory of computation -- Logic -- Proof theory</subject><ispartof>Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, 2010, p.147-156</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,780,784,789,790,27925</link.rule.ids></links><search><contributor>Rideau, Laurence</contributor><contributor>Calmet, Jacques</contributor><contributor>Rioboo, Renaud</contributor><contributor>Ion, Patrick D. F.</contributor><contributor>Sexton, Alan P.</contributor><contributor>Autexier, Serge</contributor><contributor>Delahaye, David</contributor><creatorcontrib>Asperti, Andrea</creatorcontrib><creatorcontrib>Coen, Claudio Sacerdoti</creatorcontrib><title>Some considerations on the usability of interactive provers</title><title>Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics</title><description>In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions.</description><subject>Computing methodologies</subject><subject>Computing methodologies -- Symbolic and algebraic manipulation</subject><subject>Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms</subject><subject>Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Theorem proving algorithms</subject><subject>Mathematics of computing</subject><subject>Mathematics of computing -- Continuous mathematics</subject><subject>Mathematics of computing -- Continuous mathematics -- Calculus</subject><subject>Mathematics of computing -- Continuous mathematics -- Calculus -- Lambda calculus</subject><subject>Theory of computation</subject><subject>Theory of computation -- Logic</subject><subject>Theory of computation -- Logic -- Proof theory</subject><isbn>9783642141270</isbn><isbn>3642141277</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid/><recordid>eNqNj01LxDAURQMiKGPXbrN005o0L02CKxn8GBhwoa5DkiYYnWmkiQP-ezPaH-DdnAf38uAgdElJx2uuqVQAknW_VPIENUpINkBPgfaCnKEm53dSAzBwrs7RzXPae-zSlOPoZ1NivXCacHnz-CsbG3exfOMUcJxK7V2JB48_53Twc75Ap8Hssm8WrtDr_d3L-rHdPj1s1rfb1lAuSqsoIcb2KphgwYkAxAJzQgnKDe9Hb2U_BGIHwZSiQVpzxECdoMAgjMBW6Orvr3F7bVP6yJoSffTVi69efOu0--dU2zn6wH4AfGVWgw</recordid><startdate>20100705</startdate><enddate>20100705</enddate><creator>Asperti, Andrea</creator><creator>Coen, Claudio Sacerdoti</creator><general>Springer-Verlag</general><scope/></search><sort><creationdate>20100705</creationdate><title>Some considerations on the usability of interactive provers</title><author>Asperti, Andrea ; Coen, Claudio Sacerdoti</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a157t-9100ab29fafb4c7f40b43c79715a52deb826f0b673991f8ba991f61c71434fd43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Computing methodologies</topic><topic>Computing methodologies -- Symbolic and algebraic manipulation</topic><topic>Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms</topic><topic>Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Theorem proving algorithms</topic><topic>Mathematics of computing</topic><topic>Mathematics of computing -- Continuous mathematics</topic><topic>Mathematics of computing -- Continuous mathematics -- Calculus</topic><topic>Mathematics of computing -- Continuous mathematics -- Calculus -- Lambda calculus</topic><topic>Theory of computation</topic><topic>Theory of computation -- Logic</topic><topic>Theory of computation -- Logic -- Proof theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Asperti, Andrea</creatorcontrib><creatorcontrib>Coen, Claudio Sacerdoti</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Asperti, Andrea</au><au>Coen, Claudio Sacerdoti</au><au>Rideau, Laurence</au><au>Calmet, Jacques</au><au>Rioboo, Renaud</au><au>Ion, Patrick D. F.</au><au>Sexton, Alan P.</au><au>Autexier, Serge</au><au>Delahaye, David</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Some considerations on the usability of interactive provers</atitle><btitle>Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics</btitle><date>2010-07-05</date><risdate>2010</risdate><spage>147</spage><epage>156</epage><pages>147-156</pages><isbn>9783642141270</isbn><isbn>3642141277</isbn><abstract>In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.5555/1894483.1894498</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISBN: 9783642141270 |
| ispartof | Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, 2010, p.147-156 |
| issn | |
| language | eng |
| recordid | cdi_acm_books_10_5555_1894483_1894498 |
| source | Springer Books |
| subjects | Computing methodologies Computing methodologies -- Symbolic and algebraic manipulation Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Theorem proving algorithms Mathematics of computing Mathematics of computing -- Continuous mathematics Mathematics of computing -- Continuous mathematics -- Calculus Mathematics of computing -- Continuous mathematics -- Calculus -- Lambda calculus Theory of computation Theory of computation -- Logic Theory of computation -- Logic -- Proof theory |
| title | Some considerations on the usability of interactive provers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T02%3A56%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Some%20considerations%20on%20the%20usability%20of%20interactive%20provers&rft.btitle=Proceedings%20of%20the%2010th%20ASIC%20and%209th%20MKM%20international%20conference,%20and%2017th%20Calculemus%20conference%20on%20Intelligent%20computer%20mathematics&rft.au=Asperti,%20Andrea&rft.date=2010-07-05&rft.spage=147&rft.epage=156&rft.pages=147-156&rft.isbn=9783642141270&rft.isbn_list=3642141277&rft_id=info:doi/10.5555/1894483.1894498&rft_dat=%3Cacm%3Eacm_books_10_5555_1894483_1894498%3C/acm%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |