Constructors of the same name confuse Agda about hott-agda

[aerskine]

If anyone is interested, this problem is being caused by the definition of truncation level:

data TLevel : Type₀ where
⟨-2⟩ : TLevel
S : (n : TLevel) → TLevel

The use of S for succ is confusing Agda.

Perhaps consider renaming this S to STLevel or sucT for example... the occasional highlighting errors it causes can be very distracting!

[pthariensflame]

In the meantime, you can use the following instead of open import HoTT to help fix it:

open import HoTT hiding (module TLevel)
open TLevel renaming (S to sucT)

[favonia]

@aerskine Sorry that I wasn't very responsive. One reason is that I am not personally using Emacs mode and was waiting for others. Does this always happen with the constructors with the same name? I thought Agda will fully parse the whole file before highlighting it, which means that this could be an Agda bug. Did I miss something here?

[favonia]

@aerskine @pthariensflame Hi, I am wondering if newer Agda renders the overloaded constructors correctly. Personally I am not using Emacs so I need feedback from you. Thanks.

[mikeshulman]

I'm using Emacs and I just tried out the sample linked to in the report and see the same behavior with Agda 2.5.1.1.

Commenting out the imports and replacing them with the commented lines doesn't work though; it complains "Duplicate binding for built-in thing LEVEL, previous binding to .Agda.Primitive.Level"

[favonia]

I feel this issue is lingering for too long so I installed Emacs for myself to see what is going on. This is not about highlighting at all---the code simply fails to compile because Agda is unable to resolve S n by just looking at the type of n; it has to know the entire expression S n is a natural number first. Therefore, the real issue is whether we want constructors of the same name.

@mikeshulman The error message is due to a recent change in Agda. Here is a self-contained fragment that exposes the issue.

data _==_ {A : Set} (a : A) : A → Set where
  idp : a == a

data ℕ : Set where
  O : ℕ
  S : (n : ℕ) → ℕ

data TLevel : Set where
  ⟨-2⟩ : TLevel
  S : (n : TLevel) → TLevel

S= : {m n : ℕ} → m == n → S m == S n
S= idp = idp