The differential lambda-calculus
| Autor: | Laurent Regnier, Thomas Ehrhard |
|---|---|
| Přispěvatelé: | Institut de mathématiques de Luminy (IML), Université de la Méditerranée - Aix-Marseille 2-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de la Méditerranée - Aix-Marseille 2 |
| Rok vydání: | 2003 |
| Předmět: |
Normalization (statistics)
Pure mathematics General Computer Science education Linear logic 0102 computer and information sciences 01 natural sciences Theoretical Computer Science symbols.namesake Denotational semantics Computer Science::Logic in Computer Science Calculus Taylor series Lambda-calculus 0101 mathematics computer.programming_language Mathematics Linear head reduction 010102 general mathematics [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] stomatognathic diseases 010201 computation theory & mathematics Confluence symbols ACM F.3.2 Lambda calculus computer Computer Science(all) |
| Zdroj: | Theoretical Computer Science Theoretical Computer Science, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩ Theoretical Computer Science, Elsevier, 2003, 309 (1-3), pp.1-41. ⟨10.1016/S0304-3975(03)00392-X⟩ |
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/s0304-3975(03)00392-x |
| Popis: | 41 pages; International audience; We present an extension of the lambda-calculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambda-calculus. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect