A Strong Bisimulation for a Classical Term Calculus
When translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of $\lambda$-calculus translated to proof-nets, these inessential details are captured by a notion of equivalence on $\lambda$-terms known as $\simeq_\sigma$-equivalence, in both the...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Logical Methods in Computer Science e.V.
2024-04-01
|
| Col·lecció: | Logical Methods in Computer Science |
| Matèries: | |
| Accés en línia: | http://lmcs.episciences.org/7089/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|