On Wednesday, March 8, 2017 at 1:43:56 AM UTC+1, Evgenii Moiseenko wrote:
>
> I was wondering how the implementation of map-like data structure should
> look like in MiniKanren. I am writing an interpreter of imperative language
> in MiniKanren and I need a data structure to represent a mappings between
> variables and their values.
>
> Is there any code that implements that ?
>
You can do this
(pk (run* (a)
(fresh (x)
(== x `((a . ,a)
(b . garbage)))
(== x `((a . "ROCKSTAR")
(b . garbage))))))
--
You received this message because you are subscribed to the Google Groups
"minikanren" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/minikanren.
For more options, visit https://groups.google.com/d/optout.
