Skip to content

kcsmnt0/finite

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

44 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Finite

This is a small library for working with finite sets, based on some of the constructs in [1]: a set is considered finite if there's a list that can be shown to contain all of its elements. A form of the finite pigeonhole theorem is implemented in Finite.Pigeonhole: any vector of length n with elements drawn from a finite set with cardinality less than n must contain at least one element that occurs at least twice.

  1. Dependently Typed Programming with Finite Sets (Denis Firsov & Tarmo Uustalu, Institute of Cybernetics at Tallinn University of Technology)

How to build

Building requires the Agda standard library to be installed and associated with the name standard-libarary in an Agda libraries file.

This code is tested against development versions of the Agda compiler and standard library, and was last tested working on July 11, 2024.

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published