reading terms without unification 
Author Message
 reading terms without unification

Hi!
If anybody knows
if there exists any function that reads terms without unification?


Sat, 10 May 2003 03:00:00 GMT  
 reading terms without unification

Quote:

> Hi!
> If anybody knows
> if there exists any function that reads terms without unification?

You will have to explain what you mean by that.

* there are nu functions in Prolog
* if you meant to say `predicate' then the answer is no.
you could define, though:

my_read(X) :-
    read(Y).

but I guess you meant something else.

--
Gertjan van Noord Alfa-informatica, RUG,  Postbus 716, 9700 AS Groningen
vannoord at let dot rug dot nl            http://www.let.rug.nl/~vannoord



Sat, 10 May 2003 03:00:00 GMT  
 reading terms without unification

"Rain Tamm" wrote :

Quote:
> Hi!
> If anybody knows
> if there exists any function that reads terms without unification?

No, there aren't.

To read in a term, prolog has to put the term into a variable.
To do that, it "unifies" the variable with the term.

--
Martin Sondergaard,
London.



Sat, 10 May 2003 03:00:00 GMT  
 
 [ 3 post ] 

 Relevant Pages 

1. Unification of Untyped Lambda Terms?

2. rational term unification and conservation of sharing

3. Unification of rational terms

4. Unification with infinite terms

5. term retrieval from RDBMS by unification

6. Prolog without terms

7. HELP READING TERM IN SICSTUS !!!

8. 'reading' atoms into terms

9. HOW: Read character from a term

10. Term prcedence and stream terms

11. reading an ASCII file without defining it in a Dictionary

12. Read big ASCII file without linebreaks

 

 
Powered by phpBB® Forum Software