Abstract
The paper presents an extension of the proof editor Alfa with natural-language input and output. The basis of the new functionality is an automatic translation to syntactic structures that are closer to natural language than the type-theoretical syntax of Alfa. These syntactic structures are mapped into texts in languages such as English, French, and Swedish. In this way, every theory, definition, proposition, and proof in Alfa can be translated into a text in any of these languages. The translation is defined for incomplete proof objects as well, so that a text with “holes” (i.e. metavariables) in it can be viewed simultaneously with a formal proof constructed. The mappings into natural language also work in the parsing direction, so that input can be given to the proof editor in a natural language. The natural-language interface is implemented using the Grammatical Framework GF, so that it is possible to change and extend the interface without recompiling the proof editor. Such extensions can be made on two dimensions: by adding new target languages, and by adding theory specific grammatical annotations to make texts more idiomatic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lennart Augustsson. Cayenne — a language with dependent types. In Proc. of the International Conference on Functional Programming (ICFP’98). ACM Press, September 1998. 72
M. Carlsson and T. Hallgren. Fudgets — Purely Functional Processes with applications to Graphical User Interfaces. PhD thesis, Department of Computing Science, Chalmers University of Technology, S-412 96 Göteborg, Sweden, March 1998. 72
C. Coquand. AGDA Homepage. http://www.cs.chalmers.se/~catarina/agda/, 1998. 72
C. Coquand and T. Coquand. Structured type theory. In Workshop on Logical Frameworkds and Meta-languages, Paris, France, Sep 1999. 72
Y. Coscoy. A natural language explanation of formal proofs. In C. Retoré, editor, Logical Aspects of Computational Linguistics, number 1328 in Lecture Notes in Artificial Intelligence, pages 149–167, Heidelberg, 1997. Springer. 72, 83
Y. Coscoy. Explication textuelle de preuves pour le calcul des constructions inductives. PhD thesis, Université de Nice-Sophia-Antipolis, 2000. 71
Y. Coscoy, G. Kahn, and L. Théry. Extracting text from proof. In M. Dezani and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculus and Applications (TLCA), Edinburgh, number 902 in Lecture Notes in Computer Science. Springer-Verlag, 1996. 71, 71, 77
N. G. de Bruijn. Mathematical Vernacular: a Language for Mathematics with Typed Sets. In R. Nederpelt, editor, Selected Papers on Automath, pages 865–935. North-Holland Publishing Company, 1994. 71
T. Hallgren. Home Page of the Proof Editor Alfa. http://www.cs.chalmers.se/~hallgren/Alfa/, 1996-2000. 72
Waterloo Maple Inc. Maple Homepage. http://www.maplesof.com/, 2000. 70
L. Magnusson. The Implementation of ALF-a Proof Editor based on Martin-Löf’ s Monomorphic Type Theory with Explicit Substitution. PhD thesis, Department of Computing Science, Chalmers University of Technology and University of Göteborg, 1994. 70, 72
P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984. 72
A. Ranta. Context-relative syntactic categories and the formalization of mathematical text. In S. Berardi and M. Coppo, editors, Types For Proofs and Programs, number 1158 in Lecture Notes in Computer Science, pages 231–248. Springer-Verlag, 1996. 72
A. Ranta. Structures grammaticales dans le français mathématique. Mathématiques, informatique et Sciences Humaines, (138, 139):5–56, 5-36, 1997. 72
A. Ranta. A multilingual natural-language interface to regular expressions. In L. Karttunen and K. Oflazer, editors, Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pages 79–90, Ankara, 1998. Bilkent University. 82
A. Ranta. Grammatical Framework Homepage. http://www.cs.chalmers.se/~aarne/GF/index.html, 2000. 74
Inc. Wolfram Research. Mathematica Homepage. http://www.wolfram.com/products/mathematica/, 2000. 70
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hallgren, T., Ranta, A. (2000). An Extensible Proof Text Editor. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-44404-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41285-4
Online ISBN: 978-3-540-44404-6
eBook Packages: Springer Book Archive