Skip to main content

MikiBeta : A General GUI Library for Visualizing Proof Trees

System Description and Demonstration

  • Conference paper

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


This paper describes and demonstrates MikiBeta, a general graphical user interface (GUI) library we are developing for visualizing proof trees. Using MikiBeta, one can construct a proof tree step by step by selecting a judgement and clicking an inference rule to apply, without worrying about instanciating metavariables with their contents, copying similar expressions for each judgement, or how much space is necessary to visualize the complete proof tree. To cope with different kinds of proof trees, MikiBeta is parameterized with user-defined judgements and inference rules. Because MikiBeta allows arbitrary side-effect-free user code in inference rules, one can construct GUIs with complex operations such as environment lookup and substitution. We have successfully visualized typing derivations for λ calculi with let polymorphism and with shift and reset, System F, as well as a simple deduction system for Combinatory Logic.


  • graphical user interface (GUI)
  • proof tree
  • type system
  • two-level type
  • λ calculus
  • shift and reset
  • System F
  • OCaml
  • LablTk

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as 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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development Coq’Art: The Calculus of Inductive Constructions. EATCS Series. Springer, Berlin (2004)

    CrossRef  MATH  Google Scholar 

  2. Danvy, O., Filinski, A.: A Functional Abstraction of Typed Contexts. Technical Report 89/12, DIKU, University of Copenhagen (July 1989)

    Google Scholar 

  3. Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  4. Geuvers, H., Jojgov, G.I.: Open Proofs and Open Terms: A Basis for Interactive Logic. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 537–552. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  5. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  6. Yakushev, A.R., Holdermans, S., Löh, A., Jeuring, J.: Generic Programming with Fixed Points for Mutually Recursive Datatypes. In: Proceedings of the 2009 ACM SIGPLAN International Conference on Functional Programming (ICFP 2009), pp. 233–244 (August 2009)

    Google Scholar 

  7. Sheard, T., Pasalic, E.: Two-Level Types and Parameterized Modules. Journal of Functional Programming 14(5), 547–587 (2004)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakurai, K., Asai, K. (2011). MikiBeta : A General GUI Library for Visualizing Proof Trees. In: Alpuente, M. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2010. Lecture Notes in Computer Science, vol 6564. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20550-7

  • Online ISBN: 978-3-642-20551-4

  • eBook Packages: Computer ScienceComputer Science (R0)