Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2019-10-10T17:51:35Z
dc.date.available 2019-10-10T17:51:35Z
dc.date.issued 2006
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/83098
dc.description.abstract We derive an abstract machine from the Curry-Howard correspondence with a sequent calculus presentation of Intuitionistic Propositional Linear Logic. The states of the register based abstract machine comprise a low-level code block, a register bank and a dump holding suspended procedure activations. Transformation of natural deduction proofs into our sequent calculus yields a type-preserving compilation function from the Linear Lambda Calculus to the abstract machine. We prove correctness of the abstract machine with respect to the standard call-by-value evaluation semantics of the Linear Lambda Calculus en
dc.format.extent 99-121 es
dc.language en es
dc.subject Abstract Machine es
dc.subject Compilation es
dc.subject Curry-Howard Isomorphism es
dc.subject Linear Lambda Calculus es
dc.subject Linear Logic es
dc.title The Linear Logical Abstract Machine en
dc.type Articulo es
sedici.identifier.other doi:10.1016/j.entcs.2006.04.007 es
sedici.identifier.other eid:2-s2.0-33646134415 es
sedici.identifier.issn 1571-0661 es
sedici.creator.person Bonelli, Eduardo es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Laboratorio de Investigación y Formación en Informática Avanzada es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Electronic Notes in Theoretical Computer Science es
sedici.relation.journalVolumeAndIssue vol. 158, no. 1 es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)