Mostrar el registro completo del ítem
Lanese, I.; Nishida, N.; Palacios, A.; Vidal, G. (2018). A theory of reversibility for Erlang. Journal of Logical and Algebraic Methods in Programming. 100:71-97. https://doi.org/10.1016/j.jlamp.2018.06.004
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/145737
Título: | A theory of reversibility for Erlang | |
Autor: | Lanese, Ivan Nishida, Naoki | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
[EN] In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | https://doi.org/10.1016/j.jlamp.2018.06.004 | |
Código del Proyecto: |
...[+] |
|
Agradecimientos: |
This work has been partially supported by MINECO/AEI/FEDER (EU) under grants TIN2013-44742-C4-1-R and TIN2016-76843-C4-1-R, by the Generalitat Valenciana under grant PROMETEO-II/2015/013 (SmartLogic), by the COST Action ...[+]
|
|
Tipo: |
|