Classical Combinatory Logic
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Col·lecció: | Discrete Mathematics & Theoretical Computer Science |
| Matèries: | |
| Accés en línia: | https://dmtcs.episciences.org/3469/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|