Downloads

• 2012
  • M. Cramer: Implicit dynamic function introduction and its connections to the foundations of mathematics, paper for PhML 2012.
• 2011
  • M. Cramer: Higher-Order Dynamic Predicate Logic, extended abstract for COCONAT 2011.
  • M. Cramer, P. Koepke, and B. Schröder: Parsing and Disambiguation of Symbolic Mathematics in the Naproche System, paper for CICM 2011.
• 2010
  • M. Cramer and B. Schröder: Interpreting Plurals in the Naproche CNL, paper for CNL 2010. The original publication is available at www.springerlink.com.
  • M. Cramer, D. Kühlwein, and B. Schröder: Presupposition Projection and Accommodation in Mathematical Texts, paper for KONVENS 2010.
  • M. Cramer, P. Koepke, D. Kühlwein, and B. Schröder: Premise Selection in the Naproche System, paper for IJCAR 2010. The original publication is available at www.springerlink.com.
  • M. Carl, P. Koepke: Interpreting Naproche – An algorithmic approach to the derivation-indicator view, paper for the International Symposium on Mathematical Practice and Cognition at the AISB 2010.
  • Sebastian Zittermann: Internship Report
• 2009
  • Doerthe Arndt: Diploma thesis, Semantik und Korrektheit von Prolog-Programmen im Naproche-Projekt
  • M. Cramer, B. Fisseni, P. Koepke, D. Kühlwein, B. Schröder and J. Veldman: The Naproche Project – Controlled Natural Language Proof Checking of Mathematical Texts, paper for CNL 2009. The original publication is available at www.springerlink.com.
  • M. Carl, M. Cramer and D. Kühlwein: Chapter 1 of Landau in Naproche, the first chapter of our Landau translation.
  • M. Cramer, P. Koepke, D. Kühlwein, and B. Schröder: The Naproche System, paper for the Calculemus 2009.
  • Mona Rahn: Internship Report
  • John Schmid: Internship Report
  • Marcos Cramer: Master thesis, Mathematisch-logische Aspekte von Beweisrepräsentationsstrukturen, explains the mathematical and logical aspects of Proof Representation Structures.
  • Daniel Kuehlwein: Diploma thesis, A calculus for Proof Representation Structures, explains the theoretical background of the checking algorithm.
• 2008
  • Daniel Kuehlwein: A Short Introduction To Naproche v0.1, a technical report which describes the checking algorithm.
  • Shruti Gupta: Internship Report
  • Bhoomija Ranjan: Internship Report
  • Nickolay Kolev: Magister thesis, Generating Proof Representation Structures in the Project NAPROCHE, defines PRSs and explains how to create them from a Naproche text.
• 2007
  • Peter Koepke: The Language of Proofs, talk given March 22, 2007 at a joint session of the Trimestre on Applications of Proof Theory in Mathematics and the Seminar on Formal Mathematics (pdf-slides).
  • Peter Koepke: a sample Naproche Session, Some applications of the current Naproche version with explanations.