메뉴 건너뛰기




Volumn 8, Issue 1, 2012, Pages

A synthesis of the procedural and declarative styles of interactive theorem proving

Author keywords

Declarative proof style; Formal mathematics; HOL; Interactive theorem proving; Mizar; Natural deduction; Procedural proof style; Proof assistants; Tactics

Indexed keywords


EID: 84859966332     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(1:30)2012     Document Type: Article
Times cited : (17)

References (55)
  • 2
    • 79960924249 scopus 로고    scopus 로고
    • Agda Development Team
    • Agda Development Team. The Agda Wiki. http://wiki.portal.chalmers.se/agda/pmwiki.php.
    • The Agda Wiki
  • 7
    • 18944373424 scopus 로고    scopus 로고
    • Towards an Interactive Mathematical Proof Language
    • In F. Kamareddine, editor, Kluwer
    • Henk Barendregt. Towards an Interactive Mathematical Proof Language. In F. Kamareddine, editor, Thirty Five Years of Automath, pages 25-36. Kluwer, 2003.
    • (2003) Thirty Five Years of Automath , pp. 25-36
    • Barendregt, H.1
  • 14
    • 84879665206 scopus 로고    scopus 로고
    • A declarative proof language for the Coq proof assistant
    • In number 4941 in LNCS. Springer-Verlag
    • Pierre Corbineau. A declarative proof language for the Coq proof assistant. In TYPES 2007: Types for Proofs and Programs, number 4941 in LNCS. Springer-Verlag, 2007.
    • (2007) TYPES 2007: Types for Proofs and Programs
    • Corbineau, P.1
  • 15
    • 19044399850 scopus 로고
    • The Mathematical Vernacular, a language for mathematics with typed sets
    • In P. Dybjer et al., editors, Marstrand, Sweden
    • N.G. de Bruijn. The Mathematical Vernacular, a language for mathematics with typed sets. In P. Dybjer et al., editors, Proceedings of the Workshop on Programming Languages, Marstrand, Sweden, 1987.
    • (1987) Proceedings of the Workshop on Programming Languages
    • de Bruijn, N.G.1
  • 16
    • 24644497636 scopus 로고    scopus 로고
    • Formal Specification and Verification of ARM6
    • In D.A. Basin and B. Wolff, editors, of LNCS. Springer
    • Anthony Fox. Formal Specification and Verification of ARM6. In D.A. Basin and B. Wolff, editors, TPHOLs 2003, volume 2758 of LNCS. Springer, 2003.
    • (2003) TPHOLs 2003 , vol.2758
    • Fox, A.1
  • 19
    • 0004214306 scopus 로고
    • editors. Cambridge University Press, Cambridge
    • Mike Gordon and Tom Melham, editors. Introduction to HOL. Cambridge University Press, Cambridge, 1993.
    • (1993) Introduction to HOL
    • Gordon, M.1    Melham, T.2
  • 22
    • 84859955841 scopus 로고    scopus 로고
    • To appear in 2012 in a special volume of Lecture Notes in Logic (CUP) in commemoration of the centennial of Turing's birth
    • Tom Hales. Mathematics in the Age of the Turing Machine, 2011. To appear in 2012 in a special volume of Lecture Notes in Logic (CUP) in commemoration of the centennial of Turing's birth.
    • (2011) Mathematics in the Age of the Turing Machine
    • Hales, T.1
  • 24
    • 0342341275 scopus 로고    scopus 로고
    • A Mizar Mode for HOL
    • In J. von Wright, J. Grundy, and J. Harrison, editors, of LNCS
    • John Harrison. A Mizar Mode for HOL. In J. von Wright, J. Grundy, and J. Harrison, editors, TPHOLs '96, volume 1125 of LNCS, 1996.
    • (1996) TPHOLs '96 , vol.1125
    • Harrison, J.1
  • 25
    • 84957666404 scopus 로고    scopus 로고
    • Optimizing Proof Search in Model Elimination
    • In M. A. McRobbie and J. K. Slaney, editors, New Brunswick, NJ, Springer-Verlag
    • John Harrison. Optimizing Proof Search in Model Elimination. In M. A. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction, volume 1104 of LNCS, pages 313-327, New Brunswick, NJ, 1996. Springer-Verlag.
    • (1996) 13th International Conference on Automated Deduction, volume 1104 of LNCS , pp. 313-327
    • Harrison, J.1
  • 29
    • 70349600238 scopus 로고    scopus 로고
    • Formalizing an Analytic Proof of the Prime Number Theorem
    • In R. Boulton, J. Hurd, and K. Slind, editors, The Royal Society
    • John Harrison. Formalizing an Analytic Proof of the Prime Number Theorem. In R. Boulton, J. Hurd, and K. Slind, editors, Tools and Techniques for Verification of System Infrastructure, pages 243-261. The Royal Society, 2008.
    • (2008) Tools and Techniques for Verification of System Infrastructure , pp. 243-261
    • Harrison, J.1
  • 31
    • 84859965518 scopus 로고    scopus 로고
    • Merging procedural and declarative proof
    • In S. Berardi, F. Dami-ani, and U. De'Liquoro, editors
    • Cezary Kaliszyk and Freek Wiedijk. Merging procedural and declarative proof. In S. Berardi, F. Dami-ani, and U. De'Liquoro, editors, TYPES 2008, 2009.
    • (2009) TYPES 2008
    • Kaliszyk, C.1    Wiedijk, F.2
  • 34
    • 33745802808 scopus 로고    scopus 로고
    • Formal Certification of a Compiler Back-end, or: Programming a Compiler with a Proof Assistant
    • In
    • Xavier Leroy. Formal Certification of a Compiler Back-end, or: Programming a Compiler with a Proof Assistant. In POPL'06, 2006.
    • (2006) POPL'06
    • Leroy, X.1
  • 35
    • 84859955839 scopus 로고    scopus 로고
    • Lemma 1 Ltd. Lemma 1 Ltd
    • Lemma 1 Ltd. ProofPower-Description. Lemma 1 Ltd., 2000.
    • (2000) ProofPower-Description
  • 41
    • 84969679375 scopus 로고    scopus 로고
    • A History of Natural Deduction and Elementary Logic Textbooks
    • In J. Woods and B. Brown, editors, Hermes Science Pubs
    • Jeff Pelletier. A History of Natural Deduction and Elementary Logic Textbooks. In J. Woods and B. Brown, editors, Logical Consequence: Rival Approaches and New Studies, Vol. 1. Hermes Science Pubs., 2000.
    • (2000) Logical Consequence: Rival Approaches and New Studies, Vol. 1
    • Pelletier, J.1
  • 43
    • 0343303210 scopus 로고    scopus 로고
    • How to Believe a Machine-Checked Proof
    • In G. Sambin and J. Smith, editors, Oxford University Press, Oxford
    • Randy Pollack. How to Believe a Machine-Checked Proof. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, Oxford, 1998.
    • (1998) Twenty-Five Years of Constructive Type Theory
    • Pollack, R.1
  • 45
    • 74249094031 scopus 로고    scopus 로고
    • Declarative Representation of Proof Terms
    • Claudio Sacerdoti Coen. Declarative Representation of Proof Terms. J. Autom. Reason., 44:25-52, 2010.
    • (2010) J. Autom. Reason. , vol.44 , pp. 25-52
    • Coen, C.S.1
  • 47
    • 33750434461 scopus 로고    scopus 로고
    • MizarMode-an integrated proof assistance tool for the Mizar way of formalizing mathematics
    • Josef Urban. MizarMode-an integrated proof assistance tool for the Mizar way of formalizing mathematics. J. Applied Logic, 4(4):414-427, 2006.
    • (2006) J. Applied Logic , vol.4 , Issue.4 , pp. 414-427
    • Urban, J.1
  • 51
    • 0036992197 scopus 로고    scopus 로고
    • A comparison of the mathematical proof languages Mizar and Isar
    • Markus Wenzel and Freek Wiedijk. A comparison of the mathematical proof languages Mizar and Isar. Journal of Automated Reasoning, 29:389-411, 2002.
    • (2002) Journal of Automated Reasoning , vol.29 , pp. 389-411
    • Wenzel, M.1    Wiedijk, F.2
  • 52
    • 84949508153 scopus 로고    scopus 로고
    • Mizar Light for HOL Light
    • In R. J. Boulton and P. B. Jackson, editors
    • Freek Wiedijk. Mizar Light for HOL Light. In R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001, volume 2152 of LNCS, 2001.
    • (2001) TPHOLs 2001, volume 2152 of LNCS
    • Wiedijk, F.1
  • 53
    • 35048816888 scopus 로고    scopus 로고
    • Formal Proof Sketches
    • In S. Berardi, M. Coppo, and F. Damiani, editors
    • Freek Wiedijk. Formal Proof Sketches. In S. Berardi, M. Coppo, and F. Damiani, editors, TYPES 2003, volume 3085 of LNCS, pages 378-393, 2004.
    • (2004) TYPES 2003, volume 3085 of LNCS , pp. 378-393
    • Wiedijk, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.