On Thu, Feb 12, 2015 at 12:08 PM, Keean Schupke <[email protected]> wrote: > We can write a 'C' emulator in pure lambda calculus, or perhaps better, > compile 'C' to pure lambda calculus as a target. The types of these pure > lambda terms would be the types of the C terms.
That's exactly the kind of thing I was saying doesn't solve anything, and just transforms your problems into more verbose ones. And you do realize that that's nothing like what TAL does, right? _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
