A Unified Formal Description of Arithmetic and Set Theoretical Data Types

Details A Unified Formal Description of Arithmetic and Set Theoretical Data Types A Unified Formal Description of Arithmetic and Set Theoretical Data Types

2010-06-30

arxiv.org/abs/1006.5768v1

Computer Science

Symbolic Computation

15 pages, preprint of CALCULEMUS 2010 conference paper

Scientific paper

We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type classes with examples of instances converging to an efficient implementation in terms of arbitrary length integers and bit operations. As an instance, we derive algorithms to perform arithmetic operations efficiently directly with hereditarily finite sets. The self-contained source code of the paper is available at http://logic.cse.unt.edu/tarau/research/2010/unified.hs .

Affiliated with

Also associated with

No associations

Rating

A Unified Formal Description of Arithmetic and Set Theoretical Data Types 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 A Unified Formal Description of Arithmetic and Set Theoretical Data Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Unified Formal Description of Arithmetic and Set Theoretical Data Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153492