From nangelop@csd.abdn.ac.uk  Mon May  8 12:44:34 2000
Received: from pigeon.csd.abdn.ac.uk (root@pigeon.csd.abdn.ac.uk [139.133.200.15])
	by swi.psy.uva.nl (8.9.3/8.9.3) with ESMTP id MAA01619
	for <prolog@swi.psy.uva.nl>; Mon, 8 May 2000 12:44:34 +0200 (MET DST)
Received: from kea (nangelop@kea [139.133.200.24])
	by pigeon.csd.abdn.ac.uk (8.9.3/8.9.3) with ESMTP id LAA28675
	for <prolog@swi.psy.uva.nl>; Mon, 8 May 2000 11:44:39 +0100 (BST)
Date: Mon, 8 May 2000 11:44:38 +0100
From: Nicos Angelopoulos <nangelop@csd.abdn.ac.uk>
To: prolog@swi.psy.uva.nl
Subject: using the 'mp' package 
Message-ID: <Pine.SGI.4.21.0005081121450.263280-100000@kea.csd.abdn.ac.uk>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII


point 1 

has anybody any success with mp_z/2
in the mp package ?

i get 

mp_z( 28, Z ).

Z = 28 ;

No
?- mp_z( '28', Z ).

No
?- mp_z( "28", Z ).

No


from the doc in mp.c i get the impression  that 
when the first argument is a _string_ representing
an integer the pred should be able to pick it up 

(btw i use pl-3.3.6 mp-1.2 and gmp2.0.2- no patches)

mp_z/2 along with mp_gcd/3 should solve the original 
poster's probs


point 2 

for representing probability (which i think is an important
abstraction for many areas to which prolog is a good match) 
the maximum benefit per implementor hour (:-))
is to provide long integer arithmetic the rest is 
fast enough to implement in prolog

i think that this is also true for constraints (over Q) 


regards

nicos.

