A certified extension of the Krivine machine for a call-by-name higher-order imperative language
In this paper we present a compiler that translates programs from an imperative higher-order language into a sequence of instructions for an abstract machine. We consider an extension of the Krivine machine for the call-by-name lambda calculus, which includes strict operators and imperative features...
Guardado en:
| Autores principales: | Rodríguez, Leonardo Matías, Fridlender, Daniel Edgardo, Pagano, Miguel María |
|---|---|
| Formato: | article |
| Lenguaje: | Inglés |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/11086/30119 http://dx.doi.org/10.4230/LIPIcs.TYPES.2013.230 |
| Aporte de: |
Ejemplares similares
-
The Linear Logical Abstract Machine
por: Bonelli, Eduardo
Publicado: (2006) -
Building efficient and highly run-time adaptable virtual machines
por: Chari, G., et al. -
Building efficient and highly run-time adaptable virtual machines
por: Garbervetsky, Diego
Publicado: (2016) -
Tratamiento masivo de datos utilizando técnicas de machine learning
por: Russo, Claudia, et al.
Publicado: (2020) -
Proving compiler correctness using step-indexed logical relations
por: Rodríguez, Leonardo, et al.
Publicado: (2021)