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

    GRID grid.119021.a

Book:
Proceedings CICM 2010

ISBN: 978-3-642-14127-0

Year of publication: 2010

Volume: 6167 LNAI

Pages: 204-218

Type: Book chapter

Export: RIS
DOI: 10.1007/978-3-642-14128-7_18 SCOPUS: 2-s2.0-77954880211 WoS: 000286842300018 arXiv: 1004.4998 lock_openOpen access editor
bar_chart See metrics

Summary

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.