Cargando…
Algorithmic games for full ground references
We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is [Formula: see text] . At the technical level, our result...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6560680/ https://www.ncbi.nlm.nih.gov/pubmed/31258247 http://dx.doi.org/10.1007/s10703-017-0292-9 |