Skip to content
scrambled
Programming Language Theory Concept

Concrete generator style

Books JourneyProgramming Language Theory Statuslearning Tags
  • set theory relation
  • syntax grammar

A style of formal definition that defines a set as a union of a sequence S0subseteqS1subseteqdots where each Si+1 is built from Si using rules - e.g., for naturals: S0=emptyset

A style of formal definition that defines a set as a union of a sequence S0⊆S1⊆… where each Si+1 is built from Si using rules - e.g., for naturals: S0=∅, Si+1=Si∪0∪succ(n)|n∈Si,ℕ=⋃Si.