2009
DOI: 10.1007/978-3-642-04772-5_27
|View full text |Cite
|
Sign up to set email alerts
|

Modelling Differential Structures in Proof Assistants: The Graded Case

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…This paper continues our previous work in translating Sergeraert's ideas to theorem provers [2][3][4]1], with the aim of formalizing this part of algorithmic mathematics and, more importantly, of applying formal methods to the study of the Kenzo system [12] (a Common Lisp program developed by Sergeraert to implement effective homology algorithms). The first important milestone in this area was the mechanized proof in the Isabelle/HOL proof assistant of the Basic Perturbation Lemma (BPL), published in [2].…”
Section: Introductionmentioning
confidence: 75%
“…This paper continues our previous work in translating Sergeraert's ideas to theorem provers [2][3][4]1], with the aim of formalizing this part of algorithmic mathematics and, more importantly, of applying formal methods to the study of the Kenzo system [12] (a Common Lisp program developed by Sergeraert to implement effective homology algorithms). The first important milestone in this area was the mechanized proof in the Isabelle/HOL proof assistant of the Basic Perturbation Lemma (BPL), published in [2].…”
Section: Introductionmentioning
confidence: 75%