Translating a fragment of weak type theory into type theory with open terms

Authors:
G. I. Jojgov
Affiliations:
Technische Universiteit Eindhoven, The Netherlands
Venue:
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Year:
2005

Citing 6
Cited 1

Open Proofs and Open Terms: A Basis for Interactive Logic

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Grammatical Framework

Journal of Functional Programming
A Refinement of de Bruijn's Formal Language of Mathematics

Journal of Logic, Language and Information
Colouring Proofs: A Lightweight Approach to Adding Formal Structure to Proofs

Electronic Notes in Theoretical Computer Science (ENTCS)
Structured proofs in isar/HOL

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Verifying and invalidating textbook proofs using scunak

MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main application areas of interactive proof assistants is the formalization of mathematical texts. This formalization not only allows mathematical texts to be handled electronically, but also to be checked for correctness. Due to the level of detail required in the formalization, formalized texts eliminate ambiguities that may be present in an informally presented mathematical texts.