MikiBeta : A General GUI Library for Visualizing Proof Trees
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.
Keywordsgraphical user interface (GUI) proof tree type system two-level type λ calculus shift and reset System F OCaml LablTk
Unable to display preview. Download preview PDF.
- 2.Danvy, O., Filinski, A.: A Functional Abstraction of Typed Contexts. Technical Report 89/12, DIKU, University of Copenhagen (July 1989)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