Strict Constructions [dt-003E]

When giving a semantics to a call-by-name (or "lazy") language, the constructions \twoheadrightarrow for functions, \times for products and + for sums are exactly what we want. To properly capture call-by-value (or "strict") languages, however, we also need strict versions of these constructions.

Context

Lecture. Domain theory › Constructions on cpos and PCF [dt-001Z]

Backlinks

Getting closure [dt-005Y]

Theorem. Isomorphisms with strict constructions [dt-003J]

Related

Locality of sums [dt-0039]

Construction. Product of cpos [dt-0021]

Definition. Strictness [dt-000K]

Construction. Sum of cpos [dt-0031]

Definition. The category \mathbf {Cpo_\bot } [dt-003I]

Definition. The set of continuous functions [dt-002F]