scrambled
Home//Concepts/Halt
scrambled
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Concept

Halt

Modified just now
Books
  • Chapter 3. Untyped arithmetic expressions
JourneyProgramming Language Theory Statusreviewing Tags
  • semantics

The terminal state of an Abstract machine reached when the current term is in Normal form (i.e., no evaluation rule applies), signaling completion of evaluation.

Previous in ConceptsGradual typing macro gradual typing micro gradual typingNext in Concepts Heap
Books
  • Chapter 3. Untyped arithmetic expressions
JourneyProgramming Language Theory
Statusreviewing
Tags
  • semantics