[Lambda]-calculus and combinators

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

For the lambda calculus and the combinatory logic see Hindley and Seldin's "Lambda Calculus and Combinators", published this year, I think. Hindley and Selding have been doing LC since goodness knows when, and you will see their names all over papers and texts. The book I have in mind is very recent and has orange dark red/orange cover. For partial evaluation get "Partial Evaluation and Automatic Program Generation." Jones, Gomard and Sestoft. Freely available online somewhere. If you wanna dip into semantics, there is no better text than Nielson and Nielson "Semantics with Applications", also online on the authors' website. The undergraduate "appetizer" edition is new and I can't vouch for it, but the older one is a gem of a tiny little book. This text introduces all major three semantic theories (axiomatic, operational and denotational;…