Untitled

Asperti, Andrea; Padovani, Luca; Coen, Claudio Sacerdoti; Guidi, Ferruccio; Schena, Irene

doi:10.1023/a:1022907629104

Cited by 40 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overall document is in an informal encoding. [5], the design of an electronic library of mathematics [1], the MoWGLI project [8], work to interface Coq with T E X macs [2], and the documentation system of FoC [17].) Figure 2 shows that the original Cml text is first divided into a symbolic part and a natural language part and that afterward, the full original text can be retrieved, as well as a fully symbolic part which can be passed for further processing.…”

Section: The Layermentioning

confidence: 99%

Flexible Encoding of Mathematics on the Computer

Kamareddine¹,

Maarek²,

Wells³

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports multiple views of mathematical texts, including natural language views using the exact text that the mathematician wants to use. Thus, MathLang now supports the ability to capture the essential mathematical structure of mathematics written using natural language text. We show examples of how arbitrary mathematical text can be encoded in MathLang without needing to change any of the words or symbols of the texts or their order. In particular, we show the encoding of a theorem and its proof that has been used by Wiedijk for comparing many theorem prover representations of mathematics, namely the irrationality of √ 2 (originally due to Pythagoras). We encode a 1960 version by Hardy and Wright, and a more recent version by Barendregt.

show abstract

Section: The Layermentioning

confidence: 99%