On Constructor Rewrite Systems and the Lambda Calculus
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by- value beta-reduction can be simulated b...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Logical Methods in Computer Science e.V.
2012-08-01
|
| Rangatū: | Logical Methods in Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://lmcs.episciences.org/1213/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|