. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.15 Datatypes with Field Labels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.15.1 Field Selection . . . . . . . . 26 3.15.2 Construction Using Field Labels . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 3.15.3 Updates Using Field Labels . . . . . . . . . . . . . . . . . . . . . . . . . are thus monomorphic. 3.15 Datatypes with Field Labels A datatype declaration may optionally define field labels (see Section 4.2.1). These field labels can be used to construct, select from, and update

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

telescopes. Issues related to this feature are marked with generalize [https://github.com/agda/agda/labels/generalize] in the issue tracker. Nested generalization When generalizing a variable, any generalizable δ ε _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ν (a + b) = ν a ∨ ν b δ (a + to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma}

? _ = ∅ To compute the union (or sum) of two languages, we do a point-wise or operation on the labels of their nodes: _+_ : ∀ {i A} → Lang i A → Lang i A → Lang i A ? (a + b) = ? a ∨ ? b ? (a + b) x to the code listing, is generated. It is possible to use this option several times with different labels. An example: \begin{code}[number=code:lemma] a proof \end{code} % A consequence of Lemma~\ref{code:lemma} them. You can start with the label difficulty: easy and help wanted. You can also explore all the labels. Note: The Agda User Manual is a work-in-progress and is still incomplete. Contributions, additions