A framework for checking proofs naturally

被引:0
|
作者
Masahiko Sato
机构
[1] Kyoto University,Graduate School of Informatics
关键词
Natural framework; Computation and logic; NF/CAL system;
D O I
暂无
中图分类号
学科分类号
摘要
We propose a logical framework, called Natural Framework (NF), which supports formal reasoning about computation and logic (CAL) on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observing how working mathematical theories are created and developed. Our observation is that the notions of judgments and derivations are the two fundamental notions used in any mathematical activity. We have therefore developed a theory of judgments and derivations and designed a framework in which the theory provides a uniform and common play ground on which various mathematical theories can be defined as derivation games and can be played, namely, can write and check proofs. NF is equipped with a higher-order intuitionistic logic and derivations (proofs) are described following Gentzen’s natural deduction style. NF is part of an interactive computer environment CAL and it is also referred to as NF/CAL. CAL is written in Emacs Lisp and it is run within a special buffer of the Emacs editor. CAL consists of user interface, a general purpose parser and a checker for checking proofs of NF derivation games. NF/CAL system has been successfully used as an education system for teaching CAL for undergraduate students for about 8 years. We will give an overview of the NF/CAL system both from theoretical and practical sides.
引用
收藏
页码:111 / 125
页数:14
相关论文
共 50 条
  • [1] A framework for checking proofs naturally
    Sato, Masahiko
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2008, 31 (02) : 111 - 125
  • [2] CHECKING PROOFS AND DUMMIES
    MATTHIES, LH
    MYERS, G
    JOURNAL OF SYSTEMS MANAGEMENT, 1985, 36 (11): : 22 - 23
  • [3] CHECKING NATURAL-LANGUAGE PROOFS
    SIMON, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 310 : 141 - 150
  • [4] Validation of HOL Proofs by Proof Checking
    Wai Wong
    Formal Methods in System Design, 1999, 14 : 193 - 212
  • [5] Validation of HOL proofs by proof checking
    Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong
    Formal Methods Syst Des, 2 (193-212):
  • [6] Trimming while Checking Clausal Proofs
    Heule, Marijn J. H.
    Hunt, Warren A., Jr.
    Wetzler, Nathan
    2013 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD), 2013, : 181 - 188
  • [7] Checking Zenon Modulo Proofs in Dedukti
    Cauderlier, Raphael
    Halmagrand, Pierre
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (186): : 57 - 73
  • [8] Efficient, Verified Checking of Propositional Proofs
    Heule, Marijn
    Hunt, Warren, Jr.
    Kaufmann, Matt
    Wetzler, Nathan
    INTERACTIVE THEOREM PROVING (ITP 2017), 2017, 10499 : 269 - 284
  • [9] Validation of HOL proofs by proof checking
    Wong, W
    FORMAL METHODS IN SYSTEM DESIGN, 1999, 14 (02) : 193 - 212
  • [10] Certifying Proofs for LTL Model Checking
    Griggio, Alberto
    Roveri, Marco
    Tonetta, Stefano
    PROCEEDINGS OF THE 2018 18TH CONFERENCE ON FORMAL METHODS IN COMPUTER AIDED DESIGN (FMCAD), 2018, : 225 - 233