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...
Главные авторы: | Pirog, M, Biernacki, D |
---|---|
Формат: | Conference item |
Опубликовано: |
ACM
2010
|
Схожие документы
-
Formalising and Verifying Reference Attribute Grammars in Coq.
по: Schäfer, M, и др.
Опубликовано: (2009) -
Formalising and Verifying Reference Attribute Grammars in Coq
по: Schäfer, M, и др.
Опубликовано: (2009) -
ST Genesia reference values of 117 healthy donors measured with STG‐BleedScreen, STG‐DrugScreen and STG‐ThromboScreen reagents
по: Marisa Ninivaggi, и др.
Опубликовано: (2021-01-01) -
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
по: Burak Ekici, и др.
Опубликовано: (2019-08-01) -
Extracting and optimizing low-level bytecode from high-level verified Coq
по: Ioannidis, Eleftherios Ioannis.
Опубликовано: (2019)