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...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Logical Methods in Computer Science e.V.
2024-04-01
|
| Ráidu: | Logical Methods in Computer Science |
| Fáttát: | |
| Liŋkkat: | http://lmcs.episciences.org/7089/pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|