A systematic derivation of the STG machine verified in Coq
<p>Shared Term Graph (STG) is a lazy functional language used as an intermediate language in the Glasgow Haskell Compiler (GHC). In this article, we present a natural operational semantics for STG and we mechanically derive a lazy abstract machine from this semantics, which turns out to coinci...
Main Authors: | Pirog, M, Biernacki, D |
---|---|
Formato: | Conference item |
Publicado: |
ACM
2010
|
Títulos similares
-
Formalising and Verifying Reference Attribute Grammars in Coq.
por: Schäfer, M, et al.
Publicado: (2009) -
Formalising and Verifying Reference Attribute Grammars in Coq
por: Schäfer, M, et al.
Publicado: (2009) -
ST Genesia reference values of 117 healthy donors measured with STG‐BleedScreen, STG‐DrugScreen and STG‐ThromboScreen reagents
por: Marisa Ninivaggi, et al.
Publicado: (2021-01-01) -
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
por: Burak Ekici, et al.
Publicado: (2019-08-01) -
Extracting and optimizing low-level bytecode from high-level verified Coq
por: Ioannidis, Eleftherios Ioannis.
Publicado: (2019)