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...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Logical Methods in Computer Science e.V.
2016-06-01
|
| Serie: | Logical Methods in Computer Science |
| Ämnen: | |
| Länkar: | https://lmcs.episciences.org/1644/pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|