Category Archives: Lambda Calculus

Forest Primeval → Riffs & Rotes

Re: Shifting Paradigms? • (1) • (2) • (3) • (4) • (5) • (6) Prompted by the discussion of Catalan numbers on the Foundations Of Math List, I dug up a few pieces of early correspondence and later discussions that … Continue reading

Posted in Algebra, Arithmetic, Combinatorics, Forest Primeval, Graph Theory, Group Theory, Integer Sequences, Lambda Calculus, Logic, Mathematics, Model Theory, Number Theory, Paradigms, Peirce, Programming, Proof Theory, Riffs and Rotes | Tagged , , , , , , , , , , , , , , , , | Leave a comment

Propositions As Types : 1

Re: R.J. Lipton • Mathematical Tricks One of my favorite mathematical tricks — it seems almost too tricky to be true — is the Propositions As Types Analogy.  And I see hints the 2-part analogy can be extended to a 3-part … Continue reading

Posted in Abstraction, C.S. Peirce, Combinator Calculus, Combinatory Logic, Computation, Computational Complexity, Computer Science, Curry–Howard Isomorphism, Formal Language Theory, Graph Theory, Lambda Calculus, Logic, Logical Graphs, Mathematics, Peirce, Programming Languages, Propositions As Types Analogy, Type Theory | Tagged , , , , , , , , , , , , , , , , , | Leave a comment