Skip to main content
SpringerLink
Log in
Book cover

International Conference on Interactive Theorem Proving

ITP 2016: Interactive Theorem Proving pp 123–139Cite as

Visual Theorem Proving with the Incredible Proof Machine

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9807))

Abstract

The Incredible Proof Machine is an easy and fun to use program to conduct formal proofs. It employs a novel, intuitive proof representation based on port graphs, which is akin to, but even more natural than, natural deduction. In particular, we describe a way to determine the scope of local assumptions and variables implicitly. Our practical classroom experience backs these claims.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    https://twitter.com/nomeata/status/647056837062324224, https://reddit.com/mbtk2, https://reddit.com/3m7li1, https://news.ycombinator.com/item?id=10276160, https://twitter.com/d_christiansen/status/647117704764256260, https://twitter.com/mjdominus/status/675673521255788544, https://twitter.com/IlanGodik/status/716258636566290432.

References

  1. Alves, S., Fernández, M., Mackie, I.: A new graphical calculus of proofs. In: TERMGRAPH. EPTCS, vol. 48 (2011)

    Google Scholar 

  2. Andrei, O., Kirchner, H.: A rewriting calculus for multigraphs with ports. ENTCS 219, 67–82 (2008)

    MATH  Google Scholar 

  3. Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of Object-Oriented Software. The KeY Approach. LNCS (LNAI), vol. 4334. Springer, Heidelberg (2007)

    Google Scholar 

  4. Benkmann, M.: Visualization of natural deduction as a game of dominoes. http://www.winterdrache.de/freeware/domino/data/article.html

  5. Breitner, J.: Incredible proof machine. Conversation with Sebastian Ritterbusch, Modellansatz Podcast, Episode 78, Karlsruhe Institute of Technology (2016). http://modellansatz.de/incredible-proof-machine

  6. Breitner, J., Lohner, D.: The meta theory of the incredible proof machine. Arch. Form. Proofs (2016). Formal proof development. http://isa-afp.org/entries/Incredible_Proof_Machine.shtml

  7. Coq Development Team. The Coq proof assistant reference manual. LogiCal Project (2004). version 8.0. http://coq.inria.fr

  8. Johnson, G.W.: LabVIEW Graphical Programming. McGraw-Hill, New York (1997)

    Google Scholar 

  9. Laugwitz, B., Held, T., Schrepp, M.: Construction and evaluation of a User Experience Questionnaire. In: Holzinger, A. (ed.) USAB 2008. LNCS, vol. 5298, pp. 63–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Lerner, S., Foster, S.R., Griswold, W.G.: Polymorphic blocks: formalism-inspired UI for structured connectors. In: CHI. ACM (2015)

    Google Scholar 

  11. Materzok, M.: Easyprove: a tool for teaching precise reasoning. In: TTL. Université de Rennes 1 (2015)

    Google Scholar 

  12. Mitchell, J.C., Plotkin, G.D.: Abstract types have existential type. TOPLAS 10(3), 470–502 (1988)

    Article  Google Scholar 

  13. Nipkow, T.: Functional unification of higher-order patterns. In: LICS (1993)

    Google Scholar 

  14. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  15. Selier, T.: A Propositionlogic-, naturaldeduction-proof app(lication). Bachelor’s thesis, Utrecht University (2013)

    Google Scholar 

  16. Weirich, S., Yorgey, B.A., Sheard, T.: Binders unbound. In: ICFP. ACM (2011)

    Google Scholar 

  17. Yang, E.Z.: Logitext. http://logitext.mit.edu/

Download references

Acknowledgements

We thank Denis Lohner, Richard Molitor, Martin Mohr and Nicole Rauch for their contributions to the Incredible Proof Machine, and Andreas Lochbihler and Sebastian Ritterbusch for helpful comments on a draft of this paper. Furthermore, I thank the anonymous referees for the encouraging review and the list of feature requests.

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology, Karlsruhe, Germany

    Joachim Breitner

Authors
  1. Joachim Breitner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joachim Breitner .

Editor information

Editors and Affiliations

  1. Inria Nancy – Grand Est, Villers-lès-Nancy, France

    Jasmin Christian Blanchette

  2. Inria Nancy – Grand Est, Villers-lès-Nancy, France

    Stephan Merz

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Breitner, J. (2016). Visual Theorem Proving with the Incredible Proof Machine. In: Blanchette, J., Merz, S. (eds) Interactive Theorem Proving. ITP 2016. Lecture Notes in Computer Science(), vol 9807. Springer, Cham. https://doi.org/10.1007/978-3-319-43144-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43144-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43143-7

  • Online ISBN: 978-3-319-43144-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation