| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | More exercises on computability. | David A. Madore | 2023-11-19 | 1 | -13/+250 | |
| | | ||||||
| * | Some exercises on computability. | David A. Madore | 2023-11-17 | 1 | -0/+350 | |
| | | ||||||
| * | Fix various mistakes (or notational blunders) noted during lecture on ↵ | David A. Madore | 2023-11-17 | 1 | -21/+24 | |
| | | | | | 2023-11-17. | |||||
| * | Beta-reduction and strong normalization (to be continued). | David A. Madore | 2023-11-16 | 1 | -0/+41 | |
| | | ||||||
| * | More properties of typing, incl. the substitution lemma. | David A. Madore | 2023-11-16 | 1 | -6/+97 | |
| | | ||||||
| * | Some properties of derivation in simply-typed lambda-calculus. | David A. Madore | 2023-11-16 | 1 | -0/+111 | |
| | | ||||||
| * | Give an example of a fully written out derivation tree. | David A. Madore | 2023-11-15 | 1 | -0/+39 | |
| | | ||||||
| * | Rules of the simply-typed lambda-calculus. | David A. Madore | 2023-11-15 | 1 | -3/+122 | |
| | | ||||||
| * | Various curiosities. | David A. Madore | 2023-11-15 | 1 | -3/+32 | |
| | | | | | (Thanks to Thierry Martinez for most of these suggestions.) | |||||
| * | Type systems for logic. | David A. Madore | 2023-11-15 | 1 | -1/+67 | |
| | | ||||||
| * | Curry's paradox (an interlude). | David A. Madore | 2023-11-15 | 1 | -0/+88 | |
| | | ||||||
| * | Typing and termination. | David A. Madore | 2023-11-15 | 1 | -0/+41 | |
| | | ||||||
| * | Tasks in a typing system. | David A. Madore | 2023-11-15 | 1 | -1/+45 | |
| | | ||||||
| * | More examples of languages with interesting type systems. | David A. Madore | 2023-11-15 | 1 | -4/+47 | |
| | | ||||||
| * | Use of typing systems beyond value control. | David A. Madore | 2023-11-15 | 1 | -0/+36 | |
| | | ||||||
| * | Minor clarification. | David A. Madore | 2023-11-14 | 1 | -2/+3 | |
| | | ||||||
| * | Generalities about polymorphism. | David A. Madore | 2023-11-14 | 1 | -14/+64 | |
| | | ||||||
| * | Basic set of slides on typing. | David A. Madore | 2023-11-14 | 1 | -0/+296 | |
| | | ||||||
| * | Fix mistakes in numbering of recursive functions. | David A. Madore | 2023-11-08 | 1 | -5/+8 | |
| | | | | | (Thanks, "RRt".) | |||||
| * | Rephrase for clarity. | David A. Madore | 2023-11-08 | 1 | -2/+2 | |
| | | ||||||
| * | Typos. | David A. Madore | 2023-11-06 | 1 | -3/+3 | |
| | | | | | (Thanks, Ilia.) | |||||
| * | Reread up to Rice's theorem. | David A. Madore | 2023-11-04 | 1 | -97/+166 | |
| | | ||||||
| * | Apparently "francais" is now obsolete. Sigh. | David A. Madore | 2023-11-03 | 1 | -1/+1 | |
| | | ||||||
| * | Switch to Latin Modern font (and fudge some line breaks). | David A. Madore | 2023-11-03 | 1 | -3/+4 | |
| | | ||||||
| * | Reformulate formalizations of Turing reduction. | David A. Madore | 2023-11-03 | 1 | -21/+23 | |
| | | | | | (Still not happy about this.) | |||||
| * | Typo. | David A. Madore | 2023-11-02 | 1 | -1/+1 | |
| | | | | | (Thanks, "jeanas".) | |||||
| * | One formalization of Turing reduction was wrong: quick fix (to be improved!). | David A. Madore | 2023-11-02 | 1 | -5/+5 | |
| | | ||||||
| * | A few things about Turing reduction. | David A. Madore | 2023-11-02 | 1 | -3/+128 | |
| | | ||||||
| * | Many-to-one reduction, and a new proof of Rice's theorem. | David A. Madore | 2023-11-02 | 1 | -1/+160 | |
| | | ||||||
| * | Rice's theorem. | David A. Madore | 2023-11-02 | 1 | -0/+88 | |
| | | | | | Thanks, "jeanas" for the reminder that this is important. | |||||
| * | Numbering of recursive functions (compute explicit code for sum function). | David A. Madore | 2023-11-01 | 1 | -4/+14 | |
| | | ||||||
| * | Minor changes. | David A. Madore | 2023-11-01 | 1 | -4/+4 | |
| | | ||||||
| * | Googological meditation. | David A. Madore | 2023-11-01 | 1 | -5/+39 | |
| | | ||||||
| * | Untyped lambda-calculus and a recursive type. | David A. Madore | 2023-11-01 | 1 | -0/+36 | |
| | | ||||||
| * | Typo. | David A. Madore | 2023-11-01 | 1 | -1/+1 | |
| | | | | | (Thanks, Fabrice!) | |||||
| * | Various minor corrections and clarifications. | David A. Madore | 2023-10-30 | 1 | -9/+13 | |
| | | ||||||
| * | Some comments and final thoughts. | David A. Madore | 2023-10-30 | 1 | -11/+109 | |
| | | ||||||
| * | Equivalence of functions representable in the lambda-calculus and recursive ↵ | David A. Madore | 2023-10-30 | 1 | -4/+205 | |
| | | | | | functions. | |||||
| * | Representation of p.r. functions by terms of the lambda-calculus. | David A. Madore | 2023-10-30 | 1 | -12/+138 | |
| | | ||||||
| * | Representation of functions by terms of the lambda-calculus. | David A. Madore | 2023-10-30 | 1 | -2/+38 | |
| | | ||||||
| * | A remark on arity. | David A. Madore | 2023-10-30 | 1 | -0/+53 | |
| | | ||||||
| * | Outermost-leftmost (normal order) reduction; Church numerals. | David A. Madore | 2023-10-25 | 1 | -2/+99 | |
| | | ||||||
| * | More about beta-reduction. | David A. Madore | 2023-10-20 | 1 | -16/+119 | |
| | | ||||||
| * | Lambda-calculus: terms and bound variables. | David A. Madore | 2023-10-20 | 1 | -1/+112 | |
| | | ||||||
| * | Busy beaver function. | David A. Madore | 2023-10-19 | 1 | -0/+95 | |
| | | ||||||
| * | Decidable and semi-decidable sets. | David A. Madore | 2023-10-19 | 1 | -1/+233 | |
| | | ||||||
| * | Terminological cleanup. | David A. Madore | 2023-10-19 | 1 | -26/+212 | |
| | | ||||||
| * | Slightly more about Turing machines. | David A. Madore | 2023-10-18 | 1 | -0/+107 | |
| | | ||||||
| * | Turing machines and their equivalence with recursive functions. | David A. Madore | 2023-10-18 | 1 | -5/+261 | |
| | | ||||||
| * | The recursion theorem for general recursive functions, and the Halting problem. | David A. Madore | 2023-10-18 | 1 | -9/+322 | |
| | | ||||||
 |
index : teach/inf110-lfi.git | |
| INF110 (logique et fondements de l'informatique) | git repository hosting |
| summaryrefslogtreecommitdiffstats |