Die Abschlussarbeiten können auf Englisch oder auf Deutsch geschrieben werden. Diese Seite ist auf Englisch, weil ich Englisch besser kenne. Unten folgen Themenvorschläge für Abschlussarbeiten die ich betreuen will.

The following are some proposals for master thesis topics which
I
am willing to supervise. **It is not necessary to address all
goals listed for a given topic.** Only one or some may be
sufficient for a master or a bachelor thesis, depending on which
ones and in how much depth they are treated. Contact me to talk
about the details: lukasz.czajka at tu-dortmund.de (can be in
German if you like).

It is also possible to propose your own topic, or I can invent a topic not listed here, in the following broad areas: functional programming, programming languages (theory and implementation), proof assistants, logic and type theory, automated theorem proving, deductive program verification.

Some paper links below require a subscription and are therefore accessible only through the university network.

Choose some of your favourite functional data structures (e.g. from [1]) and formalize them in Coq [2] or Isabelle/HOL. For a bachelor thesis, only a good implementation of a nontrivial functional data structure in Haskell or OCaml may be sufficient.

- C. Okasaki: Purely functional data structures
- Y. Bertot: Coq in a hurry

- Functional programming
- Coq or Isabelle/HOL (unless only implementation is done)

Hammers [3] are automated reasoning tools for proof assistants [1], which combine machine-learning with automated theorem proving. A typical use is to prove relatively simple goals using available lemmas. The problem is to find appropriate lemmas in a large collection of all accessible lemmas and combine them to prove the goal.

The machine-learning component of a hammer, called premise selection, tries to solve the following problem: given a large library of lemma statements together with their proofs, and a goal statement G, predict which lemmas are likely useful for proving G. For machine-learning purposes, proofs are usually reduced to a set of dependencies. A dependency of a lemma L is any lemma which is used in a proof of L. Hence, given a large dataset of lemma statements with their dependencies, we want to predict an over-approximation of the set of dependencies of a new statement.

CoqHammer [4,5] is a hammer tool for Coq [1] -- a proof assistant based on dependent type theory. The goal of a thesis would be to improve premise selection in CoqHammer by adapting the work done for other proof assistants.

- Design a better set of features, basing on [6].
- Implement more machine-learning methods and compare them [3, Section 2].
- Investigate adapting a deep learning approach [7].

- H. Geuvers: Proof Assistants: History, Ideas and Future
- Y. Bertot: Coq in a hurry
- J. Blanchette, C. Kaliszyk, L. Paulson, J. Urban: Hammering towards QED
- CoqHammer
- Ł. Czajka, C. Kaliszyk: Hammer for Coq: Automation for Dependent Type Theory
- C. Kaliszyk, J. Urban, J. Vyskocil: Efficient Semantic Features for Automated Reasoning over Large Theories
- A. Alemi, F. Chollet, N. Elen, G. Irving, C. Szegedy, J. Urban: DeepMath - Deep Sequence Models for Premise Selection

- Machine learning
- Functional programming
- Coq and type theory (only superficial knowledge of Coq and type theory is necessary as a prerequisite, but deeper knowledge will help)

CoqHammer [1,2] (see also the previous topic) is an automated reasoning tool for Coq - currently the most recognisable and popular such tool for Coq. However, there are many aspects of CoqHammer that could be improved. See the TODO file for a list of current problems. Some of these problems are suitable as topics for a Master thesis. A good and ambitious student could also base a Bachelor thesis on a (partial) solution to one of the problems. If you're interested in contributing to a cutting-edge research software project used by many people, ask me about the details.

- CoqHammer
- Ł. Czajka, C. Kaliszyk: Hammer for Coq: Automation for Dependent Type Theory

- Coq and LTac
- Functional programming

The goal of a thesis would be to generalise slightly some results from the literature [1,2,3] on the decidability of certain fragments of intuitionistic first-order logic and implement decision procedures for these fragments. Also implement an extension of the Intuition prover [4], which searches for proofs in minimal first-order logic (i.e. the universal-implicational fragment of intuitionistic logic), to handle all connectives.

- Extend the result from [1] on EXPSPACE-completeness of the negative fragment of minimal first-order logic without function symbols to handle all connectives and function symbols with the restriction that the size of each individual term occurring in a proof must be bounded by a constant. Analogously, extend the result from [1] on the co-NEXPTIME-completeness of the arity-bounded negative fragment of minimal first-order logic without function symbols.
- Adapt the results of [7] to show EXPTIME-completeness of the Horn fragment (i.e. derivability of an atom from a set of Horn clauses) with restrictions as in the previous point.
- Implement the above decision procedures.
- Extend Intuition [4] to handle all connectives, basing on [5]. The paper [5] and the current procedure of Intuition are based on an extension of the automata-theoretic algorithm from [6].
- Implement a decision procedure for the positive fragment [2,3]. This goal is hard and could constitute a Master thesis by itself if done in sufficient depth.

- A. Schubert, P. Urzyczyn, K. Zdanowski: On the Mints Hierarchy in First-Order Intuitionistic Logic
- G. Mints: Solvability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers
- G. Dowek, Y. Jiang: Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic
- Intuition prover
- M. Zielenkiewicz, A. Schubert: Automata Theory Approach to Predicate Intuitionistic Logic
- A. Schubert, W. Dekkers, H. Barendregt: Automata Theoretic Account of Proof Search
- B. Düdder, M. Moritz, J. Rehof, P. Urzyczyn: Bounded Combinatory Logic

- Logic and type theory

The goal of a thesis would be to compare and/or implement the proof search procedures for Pure Type Systems (or the Lambda-Cube) from the papers [1,2].

- G. Dowek: A Complete Proof Synthesis Method for the Cube of Type Systems
- S. Lengrand, R. Dyckhoff, J. McKinna: A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

- Logic and type theory

back to main page | Last updated 23 Apr 2020 by Łukasz Czajka |