Well, I guess that out of context my question boils down to: 'Is it possible to define infinite data structures and operate on them in J?'
For example, take the first ten elements of an infinite list, as in Haskell. The 'F.' primitive family seems promising indeed. Le mer. 8 janv. 2020 à 01:56, Henry Rich <henryhr...@gmail.com> a écrit : > I don't understand the task at all. You might look in NuVoc for $:, F. > etc., and M. > > Henry Rich > > On 1/7/2020 7:51 PM, Raoul Schorer wrote: > > Hi, > > > > Implementing Minikanren <http://minikanren.org/> in J by translating > from > > Scheme, I stumbled on the following: > > I have a Scheme procedure 'fives' > > < > https://github.com/jasonhemann/microKanren/blob/master/microKanren-test-programs.scm > > > > that is passed a vector and yields a procedure that then takes a pair. > > ((fives (vector 0)) '(() . 0)) > > > > My problem is that this then evaluates to a pair data -- procedure: > > ((((#(0) . 5)) . 0) . #<procedure at microKanren-test-programs.scm:677>) > > > > The second member of the pair (the procedure) is then evaluated on demand > > to yield another similar structure of length n+1, therefore allowing the > > lazy evaluation of this infinite "stream". > > > > Is switching to iterative/eager eval the only realistic way? > > Can someone help me with lazy eval of infinite structures in J, or give > me > > pointers to resources on the topic? > > > > Thanks! > > Raoul Schorer > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
