Computing in Coq with Infinite Algebraic Data Structures

Details Computing in Coq with Infinite Algebraic Data Structures Computing in Coq with Infinite Algebraic Data Structures

2010-04-28

arxiv.org/abs/1004.4998v1

Computer Science

Logic in Computer Science

To appear in Conferences on Intelligent Computer Mathematics 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing in Coq with Infinite Algebraic Data Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing in Coq with Infinite Algebraic Data Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing in Coq with Infinite Algebraic Data Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-68711