Surreal Arithmetic, Lazily

TL;DR

This paper explores efficient implementation of Conway's surreal numbers using lazy evaluation and recursive data structures, significantly improving computational speed.

Contribution

It introduces a lazy evaluation approach to surreal arithmetic, enhancing efficiency compared to previous implementations.

Findings

Lazy evaluation yields considerable speed up in surreal arithmetic operations.

Recursive data structures facilitate efficient computation of surreal numbers.

The approach demonstrates practical feasibility for surreal number calculations.

Abstract

Conway's surreal numbers were aptly named by Knuth. This note examines how far one can get towards implementing surreals and the arithmetic operations on them so that they execute efficiently. Lazy evaluation and recursive data structures yield a considerable speed up.