[图书][B] Handbook of geometric constraint systems principles

M Sitharam, AS John, J Sidman - 2018 - taylorfrancis.com
The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …

Encoding dependently-typed constructions into simple type theory

A Bordg, A Doña Mateo - Proceedings of the 12th ACM SIGPLAN …, 2023 - dl.acm.org
In this article, we show how one can formalise in type theory mathematical objects, for which
dependent types are usually deemed unavoidable, using only simple types. We outline a …

Formalizing some “small” finite models of projective geometry in Coq

D Braun, N Magaud, P Schreck - … 2018, Suzhou, China, September 16–19 …, 2018 - Springer
We study two different descriptions of incidence projective geometry: a synthetic,
mathematics-oriented one and a more practical, computation-oriented one, based on the …

A synthetic proof of Pappus' theorem in Tarski's geometry

G Braun, J Narboux - Journal of Automated Reasoning, 2017 - Springer
In this paper, we report on the formalization of a synthetic proof of Pappus' theorem. We
provide two versions of the theorem: the first one is proved in neutral geometry (without …

Formalizing constructive projective geometry in Agda

G Calderón - Electronic Notes in Theoretical Computer Science, 2018 - Elsevier
We present a formalization of Projective Geometry in the proof assistant and programming
language Agda. We formalize a recent development in constructive Projective Geometry …

Verified Quantitative Analysis of Imperative Algorithms

MPL Haslbeck - 2021 - mediatum.ub.tum.de
This thesis applies formal verification to the running time analysis of algorithms. First, three
Hoare logics for time bounds from the literature are studied and their application to …

A Matroid-Based Automatic Prover and Coq Proof Generator for Projective Incidence Geometry

D Braun, N Magaud, P Schreck - Journal of Automated Reasoning, 2024 - Springer
We present an automatic theorem prover for projective incidence geometry. This prover
does not consider coordinates. Instead, it follows a combinatorial approach based on the …

Two New Ways to Formally Prove Dandelin-Gallucci's Theorem

D Braun, N Magaud, P Schreck - Proceedings of the 2021 on …, 2021 - dl.acm.org
Mechanizing proofs of geometric theorems in 3D is significantly more challenging than in
2D. As a first noteworthy case study, we consider an iconic theorem of 3D geometry …

Mechanization of incidence projective geometry in higher dimensions, a combinatorial approach

P Schreck, N Magaud, D Braun - arXiv preprint arXiv:2201.00539, 2022 - arxiv.org
Several tools have been developed to enhance automation of theorem proving in the 2D
plane. However, in 3D, only a few approaches have been studied, and to our knowledge …

Formalization of the Poincaré disc model of hyperbolic geometry

D Simić, F Marić, P Boutry - Journal of Automated Reasoning, 2021 - Springer
We describe formalization of the Poincaré disc model of hyperbolic geometry within the
Isabelle/HOL proof assistant. The model is defined within the complex projective line CP^ 1 …