A Theorem Prover for Scientific and Educational Purposes

@inproceedings{Frank2017ATP,
  title={A Theorem Prover for Scientific and Educational Purposes},
  author={Mario Frank and Christoph Kreitz},
  booktitle={ThEdu@CADE},
  year={2017}
}
We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem prover and especially the functionality of the educational fragment. This currently supports working with terms of the untyped lambda calculus and addresses both undergraduate students and researchers. We show how the tool can be used to support the students… 

Figures from this paper

References

SHOWING 1-10 OF 22 REFERENCES

E - a brainiac theorem prover

E is a sound and complete prover for clausal first order logic with equality and has a very flexible interface for specifying search control heuristics, and an efficient inference engine.

The Penn Lambda Calculator: Pedagogical Software for Natural Language Semantics

The Penn Lambda Cal-culator is a novel pedagogical software program that can be used as an online companion to one of the standard textbooks of formal nat-ural language semantics, Heim and Kratzer (1998).

A Machine-Oriented Logic Based on the Resolution Principle

The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.

iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description)

The design of iProver is discussed, which is an instantiation-based theorem prover based on Inst-Gen calculus, complete for first-order logic, and a combination of instantiation and ordered resolution.

First-Order Proof Tactics in Higher-Order Logic Theorem Provers In Proc

  • J. Hurd
  • Computer Science, Mathematics
  • 2003
The core integrating technology is described: an ‘LCFstyle’ logical kernel for clausal first-order logic that allows the choice of different logical mappings between higher- order logic and first-orders to be used depending on the subgoal, and also enables several different first- order proof procedures to cooperate on constructing the proof.

Idris, a general-purpose dependently typed programming language: Design and implementation

This paper describes the implementation of Idris, a new dependently typed functional programming language, and presents a tactic-based method for elaborating concrete high-level syntax with implicit arguments and type classes into a fully explicit type theory.

The Leo-III Project

LEO-II, a resolution based theorem prover for classical higher-order logic, is currently being developed in a one year research project at the University of Cambridge, UK, with support from Saarland

Dependently typed programming in Agda

This talk gives an overview of the Agda programming language (Norell 2007), whose main focus is on dependently typed programming, and a number of examples of interesting dependency typed programs chosen from the domain of programming language implementation are presented as they are implemented in Agda.

TILC: The Interactive Lambda-Calculus Tracer