12 Nov
2010
12 Nov
'10
2:57 a.m.
On 11 November 2010 18:01, C. McCann <cam@uptoisomorphism.net> wrote:
For instance, assuming serialize can be applied to functions of any type, it would probably be trivial to write a function (isExpr :: a -> Bool) that reports whether an arbitrary term is a primitive value or the result of some expression [SNIP]
Persistent functional languages usually give serialized values including closures a dynamic type. So can you write isExpr :: Dynamic -> Bool ? As Persistent Haskell and Clean (both pure functional languages) have already supported serializing closures / HOFs I'm not sure its really a such semantical can of worms as this thread suggests.