Computing in Coq with infinite algebraic data structures

  1. Domínguez, C. 1
  2. Rubio, J. 1
  1. 1 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Liburua:
Proceedings CICM 2010

ISBN: 978-3-642-14127-0

Argitalpen urtea: 2010

Alea: 6167 LNAI

Orrialdeak: 204-218

Mota: Liburuko kapitulua

DOI: 10.1007/978-3-642-14128-7_18 SCOPUS: 2-s2.0-77954880211 WoS: WOS:000286842300018 arXiv: 1004.4998 GOOGLE SCHOLAR lock_openSarbide irekia editor
Gordailu instituzionala: lockSarbide irekia Editor

Lotura duten proiektuak

Gestión Mecanizada del Conocimiento Matemático. Aplicaciones en Topología Algebraica y en Lógica.

2009/00207/001

Laburpena

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type (that is to say, generated by infinite sets) as a part of the formalization of a hierarchy of homological algebra structures. © 2010 Springer-Verlag Berlin Heidelberg.