Lambda Calculus Then and Now
| Autor: | Dana S. Scott |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Discrete mathematics
Simply typed lambda calculus Natural deduction System F Lambda cube Pure type system Deductive lambda calculus TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science Church encoding Calculus Typed lambda calculus Mathematics |
| Zdroj: | ACM-TURING |
| DOI: | 10.1145/2322176.2322185 |
| Popis: | A very fast development in the early 1930s, following Hilbert's codification of Mathematical Logic, led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of recursive Function Theory. The so-called Lambda Calculus played a key role. The history of these developments will be traced, and the much later place of Lambda Calculus in Mathematics and Programming-Language Theory will be outlined. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|