by Zhaohui Luo, Paul Callaghan
Proceedings of the 2nd Inter. Conf. on Logical Aspects of Computational Linguistics, LNCS/LNAI 1582
http://www.dur.ac.uk/CARG/papers/lacl97.ps.gz
Add To MetaCart
Abstract:
Abstract. This paper investigates the semantics of mathematical concepts in a type theoretic framework with coercive subtyping. The typetheoretic analysis provides a formal semantic basis in the design and implementation of Mathematical Vernacular (MV), a natural language suitable for interactive development of mathematics with the support of the current theorem proving technology. The idea of semantic well-formedness in mathematical language is motivated with examples. A formal system based on a notion of conceptual category is then presented, showing how type checking supports our notion of well-formedness. The power of this system is then extended by incorporating a notion of subcategory, using ideas from a more general theory of coercive subtyping, which provides the mechanisms for modelling conventional abbreviations in mathematics. Finally, we outline how this formal work can be used in an implementation of MV. 1
Citations
|
555
|
The Generative Lexicon
– Pustejovsky
- 1995
|
|
211
|
Programming in Martin-Löf’s Type Theory: An Introduction
– Nordström, Petersson, et al.
- 1990
|
|
149
|
LEGO Proof Development System: User’s Manual
– Luo, Pollack
- 1992
|
|
98
|
The ALF proof editor and its proof engine
– Magnusson, Nordström
- 1994
|
|
94
|
A Survey of the Project AUTOMATH
– Bruijn
- 1980
|
|
94
|
Semantics
– Lyons
- 1979
|
|
93
|
Computation and Reasoning: A Type Theory for Computer Science
– Luo
- 1994
|
|
85
|
The Architecture of the Language Faculty
– Jackendoff
- 1997
|
|
75
|
Type-Theoretical Grammar
– Ranta
- 1994
|
|
72
|
Semiproductive polysemy and sense extension
– Copestake, Briscoe
- 1995
|
|
33
|
Extracting text from proofs
– Coscoy, Kahn, et al.
- 1995
|
|
30
|
Coercive subtyping
– Luo
- 1999
|
|
27
|
The Machine-Checked Literate Formalisation Of Algebra In Type Theory
– Bailey
- 1998
|
|
27
|
Typing algorithm in type theory with inheritance
– Saibi
- 1997
|
|
24
|
Program specification and data refinement in type theory
– Luo
- 1991
|
|
21
|
Deliverables: A categorical approach to program development in type theory
– McKinna, Burstall
- 1992
|
|
20
|
Coercive subtyping in type theory
– Luo
- 1997
|
|
19
|
A higher-order calculus and theory abstraction
– Luo
- 1991
|
|
16
|
Deliverables: a categorical approach to program development in type theory
– Burstall, McKinna
- 1992
|
|
12
|
Some proof-theoretic and algorithmic aspects of coercive subtyping. Types for proofs and programs
– Jones, Luo, et al.
- 1998
|
|
9
|
The Coq Proof Assistant Reference Manual (version 6.1). INRIARocquencourt and CNRS-ENS
– Coq
- 1996
|
|
8
|
de Bruijn. The mathematical vernacular, a language for mathematics with typed sets
– G
- 1994
|
|
6
|
Context-relative syntactic categories and the formalization of mathematical text
– Ranta
- 1996
|
|
3
|
Mathematical vernacular in type theory-based proof assistants
– Callaghan, Luo
- 1998
|
|
2
|
The formalization of linear algebra in LEGO: The decidable dependency theorem
– Jones
- 1995
|
|
2
|
Type-theoretical interpretation and generalization of phrase structure grammar
– Ranta
- 1995
|
|
2
|
A grammatical framework (some notes on the source files
– Ranta
- 1997
|
|
1
|
Formalizing Mathematics in Type Theory
– Ruys
|
|
1
|
Coercive subtyping: coherence and conservativity
– Soloviev, Luo
- 1998
|
|
1
|
Typechecking in pure type systems. submitted for publication
– Jutting, McKinna, et al.
- 1993
|
