Node Replication: Theory And Practice
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916347327283200 |
|---|---|
| author | Kesner, Delia Peyrot, Loïc Ventura, Daniel |
| author_facet | Kesner, Delia Peyrot, Loïc Ventura, Daniel |
| contents | We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_07143 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Node Replication: Theory And Practice Kesner, Delia Peyrot, Loïc Ventura, Daniel Logic in Computer Science 03B70 F.3.2; F.4.1; D.3.1 We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools. |
| title | Node Replication: Theory And Practice |
| topic | Logic in Computer Science 03B70 F.3.2; F.4.1; D.3.1 |
| url | https://arxiv.org/abs/2207.07143 |