Home//Concepts/Join

Overviewjust now

154

2

4

1082

3

2

24

633

Dimensional inference rule formatjust now Abstract binding graphjust now Abstract binding tree abtjust now Abstract binding tree abt valence abstractorjust now Abstract data typejust now

408

11

4

Overviewjust now

154

2

4

1082

3

2

24

633

Dimensional inference rule formatjust now Abstract binding graphjust now Abstract binding tree abtjust now Abstract binding tree abt valence abstractorjust now Abstract data typejust now

408

11

4

Concept

Join

Modified just now

Books

Chapter 2. Mathematical preliminaries

JourneyProgramming Language Theory Statusreviewing Tags

order-lattice-theory

In the context of a Partial order, the least upper bound of a set $S$ , denoted $\bigvee S$ .

Previous in ConceptsIterated inductive definition simultaneous inductive Next in Concepts Judgment

Books

Chapter 2. Mathematical preliminaries

JourneyProgramming Language Theory

Statusreviewing

Tags

order-lattice-theory