No solvable lambda-value term left behind
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated without loss of consistency. There is a definition of solvability...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Logical Methods in Computer Science e.V.
2016-06-01
|
| Serie: | Logical Methods in Computer Science |
| Soggetti: | |
| Accesso online: | https://lmcs.episciences.org/1644/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|