Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm
| Autor: | Lambán Pardo, Laureano, Rubio, Julio, Martín Mateos, Francisco Jesús, Ruiz Reina, José Luis |
|---|---|
| Přispěvatelé: | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla. TIC137: Lógica, Computación e Ingeniería del Conocimiento |
| Rok vydání: | 2013 |
| Předmět: | |
| Zdroj: | idUS. Depósito de Investigación de la Universidad de Sevilla instname |
| Popis: | The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying Eilenberg–Zilber theorem, using the ACL2 theorem prover. As our formalization is executable, we are able to compare the results of the certified programme with those of Kenzo on some universal examples. Since the results coincide, the reliability of Kenzo is reinforced. This is a new step in our long-term project towards certified programming for Algebraic Topology. Ministerio de Ciencia e Innovación MTM2009-13842 European Union’s 7th Framework Programme [243847] (ForMath). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|