Hello,
When defining a language, is it possible to define that all instances of a 
pattern have to be different ? For example, I have f ::= 
variable-not-otherwise-mentioned, which represents a function name. How do 
I guarantee all fs are different?
Thank you!
--Beatriz

-- 
You received this message because you are subscribed to the Google Groups 
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to racket-users+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/racket-users/40a4b1b2-a736-4499-9c21-6aec5eb3ada1n%40googlegroups.com.

Reply via email to