Almost-full relations: an Agda version for "Stop when you are almost-full"
Agda
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
AFConstructions.agda
AFInduction.agda
AlmostFull.agda
Everything.agda
README.md

README.md

Almost-full relations

Dimitrios Vytiniotis

http://research.microsoft.com/en-us/people/dimitris/

Vytiniotis, Dimitrios; Coquand, Thierry; Wahlstedt, David.
Stop when you are almost-full. Adventures in constructive termination.
Beringer, Lennart (ed.) et al., Interactive theorem proving.
Third international conference, ITP 2012,
Princeton, NJ, USA, August 13‒15, 2012. Proceedings.
Berlin: Springer (ISBN 978-3-642-32346-1/pbk).
Lecture Notes in Computer Science 7406, 250-265 (2012).

http://research.microsoft.com/en-us/people/dimitris/af-itp.pdf
http://research.microsoft.com/en-us/people/dimitris/af-itp2012.tgz
http://research.microsoft.com/en-us/people/dimitris/afchalmers.pptx