Intelligent Computer Mathematics

Isabelle/PIDE has emerged over more than 10 years as the standard Prover IDE for interactive theorem proving in Isabelle. The well-established Archive of Formal Proofs (AFP) testifies the success of such applications of formalized mathematics in Isabelle/HOL. More recently, the scope of PIDE has widened towards languages that are not connected to logic and proof in Isabelle, but taken from a broader repertoire of mathematics on the computer. The present paper provides a general overview of the PIDE project and its underlying document model, with built-in parallel evaluation and asynchronous interaction. There is also some discussion of original aims and approaches, successes and failures, later changes to the plan, and ideas for the future.

[1]  Michael Beeson,et al.  Logic and Computation in MATHPERT: An Expert System for Learning Mathematics , 1989, Computers and Mathematics.

[2]  Simon Boulier,et al.  Towards Certified Meta-Programming with Typed Template-Coq , 2018, ITP.

[3]  J. Strother Moore,et al.  Automation of Mathematical Induction as part of the History of Logic , 2013, FLAP.

[4]  Thomas F. Melham,et al.  On the Semantics of ReFLect as a Basis for a Reflective Theorem Prover , 2013, ArXiv.

[5]  K. Rustan M. Leino,et al.  Automating Induction with an SMT Solver , 2012, VMCAI.

[6]  Yutaka Nagashima,et al.  Goal-Oriented Conjecturing for Isabelle/HOL , 2018, CICM.

[7]  Cezary Kaliszyk,et al.  Learning-Assisted Automated Reasoning with Flyspeck , 2012, Journal of Automated Reasoning.

[8]  Carla Limongelli,et al.  Abstract Specification of Structures and Methods in Symbolic Mathematical Computation , 1992, Theor. Comput. Sci..

[9]  Jacques Carette,et al.  HOL Light QE , 2018, ITP.

[10]  Panagiotis Manolios,et al.  Computer-Aided Reasoning: An Approach , 2011 .

[11]  Robert S. Boyer,et al.  Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. , 1979 .

[12]  Alan Bundy,et al.  Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery , 2010, Verification, Induction, Termination Analysis.

[13]  William Sonnex.  Fixed point promotion: taking the induction out of automated induction , 2017 .

[14]  Cezary Kaliszyk,et al.  Certified Computer Algebra on Top of an Interactive Theorem Prover , 2007, Calculemus/MKM.

[15]  Christoph Benzmüller.  Towards computer aided mathematics , 2006, J. Appl. Log..

[16]  Jacques D. Fleuriot,et al.  The Boyer-Moore Waterfall Model Revisited , 2018, ArXiv.

[17]  William M. Farmer,et al.  A Simple Type Theory with Partial Functions and Subtypes , 1993, Ann. Pure Appl. Log..

[18]  Koen Claessen,et al.  Quick specifications for the busy programmer , 2017, Journal of Functional Programming.

[19]  Koen Claessen,et al.  Hipster: Integrating Theory Exploration in a Proof Assistant , 2014, CICM.

[20]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[21]  William M. Farmer,et al.  Theory Morphisms in Church's Type Theory with Quotation and Evaluation , 2017, CICM.

[22]  Sophia Drossopoulou,et al.  Zeno: An Automated Prover for Properties of Recursive Data Structures , 2012, TACAS.

[23]  William M. Farmer,et al.  Formalizing Undefinedness Arising in Calculus , 2004, IJCAR.

[24]  Alan Bundy,et al.  Conjecture Synthesis for Inductive Theories , 2011, Journal of Automated Reasoning.

[25]  Wouter Swierstra,et al.  Engineering Proof by Reflection in Agda , 2012, IFL.

[26]  D. Hilbert.  Mathematical Problems , 2019, Mathematics: People · Problems · Results.

[27]  Kapur M. SubramaniamComputer.  Lemma Discovery in Automating InductionDeepak , 1996 .

[28]  Wolfgang Schreiner,et al.  Towards the Formal Specification and Verification of Maple Programs , 2012, AISC/MKM/Calculemus.

[29]  Omar Monta.  Scheme-based Theorem Discovery and Concept Invention , 2012 .

[30]  Alan Bundy,et al.  MATHsAiD: Automated mathematical theory exploration , 2017, Applied Intelligence.

[31]  Viktor Kuncak,et al.  Induction for SMT Solvers , 2015, VMCAI.

[32]  Moa Johansson,et al.  Automated Theory Exploration for Interactive Theorem Proving: - An Introduction to the Hipster System , 2017, ITP.

[33]  Steve Linton,et al.  Lightweight formal methods for computer algebra systems , 1998, ISSAC '98.

[34]  John Harrison,et al.  HOL Light: An Overview , 2009, TPHOLs.

[35]  Cezary Kaliszyk,et al.  Automating Side Conditions in Formalized Partial Functions , 2008, AISC/MKM/Calculemus.

[36]  David Raymond Christiansen.  Type-Directed Elaboration of Quasiquotations: A High-Level Syntax for Low-Level Reflection , 2014, IFL.

[37]  A. Bundy,et al.  Automated Discovery of Inductive Theorems , 2007 .

[38]  Koji Nakagawa,et al.  Theorema: Towards computer-aided mathematical theory exploration , 2006, J. Appl. Log..

[39]  Darko Stefanovic,et al.  Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems , 2012, DNA.

[40]  William M. Farmer,et al.  Incorporating Quotation and Evaluation into Church's Type Theory: Syntax and Semantics , 2016, CICM.

[41]  Jeremy Avigad,et al.  A metaprogramming framework for formal verification , 2017, Proc. ACM Program. Lang..