Surreal numbers in coq

Authors:
Lionel Elie Mamane
Affiliations:
Institute for Computing and Information Sciences, Radboud University, Nijmegen
Venue:
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Year:
2004

Citing 6
Cited 2

Type checking with universes

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Sets in Types, Types in Sets

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Recursive Families of Inductive Types

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Nested General Recursion and Partiality in Type Theory

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Modelling general recursion in type theory

Mathematical Structures in Computer Science
Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

Licensing the Mizar mathematical library

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Partizan games in Isabelle/HOLZF

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Surreal Numbers form a totally ordered (commutative) Field, containing copies of the reals and (all) the ordinals. I have encoded most of the Ring structure of surreal numbers in Coq. This encoding relies on Aczel's encoding of set theory in type theory. This paper discusses in particular the definitional or proving points where I had to diverge from Conway's or the most natural way, like separation of simultaneous induction-recursion into two inductions, transforming the definition of the order into a mutually inductive definition of “at most” and “at least” and fitting the rather complicated induction/recursion schemes into the type theory of Coq.