From natural semantics to C: A formal derivation of two STG machines (Q5302645): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A transformation-based optimiser for Haskell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secrets of the Glasgow Haskell Compiler inliner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a fast curry: push/enter vs. eval/apply for higher-order languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving a lazy abstract machine / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0956796808006746 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125519268 / rank
 
Normal rank

Latest revision as of 11:46, 30 July 2024

scientific article; zbMATH DE number 5487666
Language Label Description Also known as
English
From natural semantics to C: A formal derivation of two STG machines
scientific article; zbMATH DE number 5487666

    Statements

    Identifiers