Hi ! Am I right, that your extension of MiniKanren to handle recursive terms are in spirit of Unification over Rational Trees theory ?
BTW, Is Unification over Rational Trees subsumes ordinary unification over finite trees (i.e. with occurs check) ? Is there cases when `occurs check` are needed in order to obtain `expected` results ? пятница, 9 марта 2018 г., 21:58:33 UTC+3 пользователь Niitsuma Hirotaka написал: > > Thak you for very useful references and codes. > I try to compare. > > > I recently ran across these slides, which talks about dealing with >> left-recursive grammars without recursive unification: >> https://staff.fnwi.uva.nl/c.u.grelck/nl-fp-talks/kourzanov.pdf >> >> Is it possible to compare your approach, and describe the pros and cons? >> How well does your approach run "backwards" and "sideways"? >> >> On Tuesday, March 6, 2018 at 9:59:51 PM UTC-5, Niitsuma Hirotaka wrote: >>> >>> >Do you have a preprint available or something? >>> >>> http://www.suri.cs.okayama-u.ac.jp/~niitsuma/cfgkanren.pdf >>> <http://www.google.com/url?q=http%3A%2F%2Fwww.suri.cs.okayama-u.ac.jp%2F~niitsuma%2Fcfgkanren.pdf&sa=D&sntz=1&usg=AFQjCNEv93tEaW5K3oKkNxT5h8eZ0Syc9A> >>> >>> >>> >>> -- 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.
