@mevenlennonbertrand@lipn.info
@mevenlennonbertrand@lipn.info avatar

mevenlennonbertrand

@mevenlennonbertrand@lipn.info

Post-doc at the University of Cambridge.

I mostly try to get proof assistants to certify themselves. Sometimes this involves studying type theory. Sometimes this means understanding what our implementations do. All in all, it's not too bad.

This profile is from a federated server and may be incomplete. Browse more on the original instance.

mevenlennonbertrand, to random
@mevenlennonbertrand@lipn.info avatar

I just realised that inductively defining an indexed inductive family T : B -> Type and then quotienting each T x by a family of relations R : Π x : B, T x -> T x -> Type is not the same as the corresponding quotient inductive type: if R is not a congruence, then the quotient-after-the-fact is not right, because it does not know that you also want to quotient the other fibers by their relation.

Is this the whole point of QITs that had completely gone over my head until now?

mevenlennonbertrand, to random
@mevenlennonbertrand@lipn.info avatar

Hi Mastodon! It seems there's quite a bit of fun discussions happening around here, so here I come.

Probably some of you know me already. For those who don't, I'm a post-doc at Cambridge, playing with proof assistants – mostly trying to convince them that they are reasonable pieces of software.

Anyway, I hope to enjoy it around here 🙂

  • All
  • Subscribed
  • Moderated
  • Favorites
  • JUstTest
  • ngwrru68w68
  • everett
  • InstantRegret
  • magazineikmin
  • thenastyranch
  • rosin
  • GTA5RPClips
  • Durango
  • Youngstown
  • slotface
  • khanakhh
  • kavyap
  • DreamBathrooms
  • provamag3
  • ethstaker
  • osvaldo12
  • tester
  • cubers
  • cisconetworking
  • mdbf
  • tacticalgear
  • modclub
  • Leos
  • anitta
  • normalnudes
  • megavids
  • lostlight
  • All magazines