 		let enumeration = Recur("Enumeration")
 		let label = Recur("Label")
 		let cons = Recur("::")
-		let branches = Recur("Branches")
+		let Branches = Recur("Branches")
 
 		// Tag : λ _ : Enumeration . Type
 		// Tag = λ E : Enumeration . λ _ : Boolean . Tag E

		// Branches = λ E : Enumeration . λ P : (λ _ : Tag E . Type) . if E.0
		//     then (P here, Branches E (λ t : Tag E . P (there t)))
		//     else Unit
		let Branches = Binding("Branches",
			lambda(enumeration) { E in
				Recur.lambda(.lambda(Tag[E], const(.Type))) { P in
					.If(.Projection(E, false),
						.Product(
							P[Recur("here")],
							branches[E, Recur.lambda(Tag[E]) { t in
								P[Recur("there")[t]]
							}]),
						.Unit)

			here,
			there,

			branches,
			`case`,
		])
	}
