Arithmetic of infinite precision in constraint solver: a tiny question

http://ats-lang.sourceforge.net/DOCUMENT/INT2PROGINATS/HTML/x2381.html
says: “By default, the constraint-solver implemented for ATS/Postiats makes
use of the standard arithmetic of infinite precision”

Do one have to understand this a rational arithmetic ? (I mean as opposed
to real arithmetic)

Only integers are used during constraint-solving.

GMP also supports rationals of infinite precision, but they are not used in
ATS.On Monday, February 2, 2015 at 6:43:44 PM UTC-5, Yannick Duchêne wrote:

http://ats-lang.sourceforge.net/DOCUMENT/INT2PROGINATS/HTML/x2381.html
says: “By default, the constraint-solver implemented for ATS/Postiats makes
use of the standard arithmetic of infinite precision”

Do one have to understand this a rational arithmetic ? (I mean as opposed
to real arithmetic)

I believe GMP is inherently based around rationals, so I believe your guess
is right.On Mon, Feb 2, 2015 at 6:43 PM, ‘Yannick Duchêne’ via ats-lang-users < ats-lan...@googlegroups.com> wrote:

http://ats-lang.sourceforge.net/DOCUMENT/INT2PROGINATS/HTML/x2381.html
says: “By default, the constraint-solver implemented for ATS/Postiats makes
use of the standard arithmetic of infinite precision”

Do one have to understand this a rational arithmetic ? (I mean as opposed
to real arithmetic)


You received this message because you are subscribed to the Google Groups
“ats-lang-users” group.
To unsubscribe from this group and stop receiving emails from it, send an
email to ats-lang-user...@googlegroups.com.
To post to this group, send email to ats-lan...@googlegroups.com.
Visit this group at http://groups.google.com/group/ats-lang-users.
To view this discussion on the web visit
https://groups.google.com/d/msgid/ats-lang-users/4f6e8a74-13ae-464e-b174-b92701f229fa%40googlegroups.com
https://groups.google.com/d/msgid/ats-lang-users/4f6e8a74-13ae-464e-b174-b92701f229fa%40googlegroups.com?utm_medium=email&utm_source=footer
.

Brandon Barker
brandon...@gmail.com