Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant characterizations of many semantic properties. We prove that...
Na minha lista:
| Principais autores: | , , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Logical Methods in Computer Science e.V.
2017-12-01
|
| 叢編: | Logical Methods in Computer Science |
| 主題: | |
| 在線閱讀: | https://lmcs.episciences.org/4162/pdf |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|