Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
A higher-order calculus and theory abstraction
Information and Computation
Program specification and data refinement in type theory
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Computational Linguistics
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
The ALF proof editor and its proof engine
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Type-theoretical grammar
Typing algorithm in type theory with inheritance
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-Relative Syntactic Categories and the Formalization of Mathematical Text
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Coercive Subtyping in Type Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Journal of Functional Programming
Implementation Techniques for Inductive Types in Plastic
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
On Communicating Proofs in Interactive Mathematical Documents
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 0.00 |
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, showingho w type checkingsupp orts our notion of well-formedness. The power of this system is then extended by incorporatinga notion of subcategory, usingideas from a more general theory of coercive subtyping, which provides the mechanisms for modellingcon ventional abbreviations in mathematics. Finally, we outline how this formal work can be used in an implementation of MV.