The Computer Journal
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
HELM and the Semantic Math-Web
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
OMDoc -- An Open Markup Format for Mathematical Documents [version 1.2]: Foreword by Alan Bundy (Lecture Notes in Computer Science)
as Authoring Tool for Formal Developments
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal correspondence between OMDoc with alternative proofs and the λµµ-calculus
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Verifying and invalidating textbook proofs using scunak
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Capturing abstract matrices from paper
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Towards a parser for mathematical formula recognition
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
A tough nut for mathematical knowledge management
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Toward an object-oriented structure for mathematical text
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Computerizing Mathematical Text with MathLang
Electronic Notes in Theoretical Computer Science (ENTCS)
Math information retrieval: user requirements and prototype implementation
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
MathLang Translation to Isabelle Syntax
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Hi-index | 0.00 |
Methods for computerised mathematics have found little appeal among mathematicians because they call for additional skills which are not available to the typical mathematician. We herein propose to reconcile computerised mathematics to mathematicians by restoring natural language as the primary medium for mathematical authoring. Our method associates portions of text with grammatical argumentation roles and computerises the informal mathematical style of the mathematician. Typical abbreviations like the aggregation of equations a = b c, are not usually accepted as input to computerised languages. We propose specific annotations to explicate the morphology of such natural language style, to accept input in this style, and to expand this input in the computer to obtain the intended representation (i.e., a = b and b c). We have named this method syntax souringin contrast to the usual syntax sugaring. All results have been implemented in a prototype editor developed on top of ${\rm\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$ $_{{\rm {\sc MACS}}}$ as a GUI for the core grammatical aspect of MathLang, a framework developed by the ULTRA group to computerise and formalise mathematics.