Re: Structures as literals
"Bradford Miller (as bradford dot w dot miller at gmail dot com)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
I suspect Dr. Bradshaw was referring to Rice’s Theorem, and meant undecidable? That doesn’t mean you can’t have something that works on a finite syntactic set. > On Mar 2, 2026, at 7:01 PM, David McClain (as dbm at refined-audiometrics dot com) <[email protected]> wrote: > > But I don’t understand your statement that it is a generally intractable problem. The system I have been using since 2009 has worked wonderfully well for me, and handles self-referential and circular references transparently. The only thing it can’t serialize is compiled code and functional closures. > > - DM > >> On Mar 2, 2026, at 15:34, Tim Bradshaw (as tfb at cley dot com) <[email protected]> wrote: >> >> On 2 Mar 2026, at 18:50, David McClain (as dbm at refined-audiometrics dot com) <[email protected]> wrote: >>> >>> Instead of MAKE-LOAD-FORM, I use a binary interchange format for my serialization across the network and to file storage. So long as another Lisp reads them back, they are portable. >> >> I was asking about the specific case of specific literal objects of objects in compiled files, not another attempt to solve a famously intractable-in-general problem. >> >> _______________________________________________ >> Lisp Hug - the mailing list for LispWorks users >> [email protected] >> http://www.lispworks.com/support/lisp-hug.html > > > _______________________________________________ > Lisp Hug - the mailing list for LispWorks users > [email protected] > http://www.lispworks.com/support/lisp-hug.html _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html