Questions tagged [spineless-tagless-graph]
4 questions
5
votes
1 answer
STG machine unboxed values handling
I'm learning about lazy functional language evaluation and came across the STG machine. In order to understand it I'm building a small toy compiler for a functional language (to STG).
However there's one thing I can't really wrap my head around:…
lav_shaun
- 81
- 1
- 4
3
votes
1 answer
In GHC's STG output with -O2, what's this sequence following Str=DmdType all about?
(Misleading title: it's only one of a plethora of inter-related similar questions below: these sound like asking for a full reference manual but keep in mind for this topic there is no reference manual other than the entirety of GHC's source-codes…
metaleap
- 2,132
- 2
- 22
- 40
3
votes
0 answers
Are the Haskell options for Tail Call Optimisation indicative of the Spineless Tagless Graph-Machine?
One of the amazing things about Haskell is the Spineless Tagless Graph Machine (STG). At the time, (according to SPJ) it was written to enable the laziness that enabled functional programming to work on the limited hardware of the time. Subsequently…
hawkeye
- 34,745
- 30
- 150
- 304
3
votes
1 answer
What would change if a JVM Language Compilation process had an STG phase like Haskell?
I had a friend say:
For me the most interesting thing about Haskell is not the language and the types. It is the Spineless Tagless Graph Machine behind it.
Because Haskell people talk about types all the time, this quote really caught my…
hawkeye
- 34,745
- 30
- 150
- 304