5:08:55lisbethslambda calculus with currying is a lisp that predates lisp
5:09:34lisbethslambda calculus is the simplest lisp but that needs the best optimizations to be fast
5:10:04lisbethssome lambda calculus code is cross compatible between lisps
5:30:55lisbethswhat most lisps seem to be able to agree on in terms of design is how lambda functions should work with only minor syntactical or internal differences between them
5:32:39lisbethsalgorithms written purely in lambdas in scheme can run in haskell so long as they don't refrerence any object that isn't a lambda
5:44:54lisbethsmany lisps have tried and failed to be the next JSON and this is arguably because not everyone can agree what lisp to use
5:45:28lisbethswe can all agree on the same lambda calculus
5:52:00rozenglasslisbeths: Can a JSON replacement be completely made up of lambdas? How would it differenciate between a key-value collection, and an array/list of objects for example? Without using any language-specific features.
5:52:55rozenglassOr is that differentiation somehow not required in the first place?
5:53:23lisbethsI think you can encode s expressions in json that way the technology doesnt need to be changed much
5:53:52lisbethsthus you can encode a lambda expression with json syntax such as an algorithm in pure lambda calculus