HACKING: Description of a refined git workflow.
the ExtLam constructor does pop up in a few places during reification

substitution and free variable computation in particular
disable display forms and extra unfolding when reifying in unquote
Unquote AGDATERMUNSUPPORTED to meta instead of raising an error
[ issue1228 ] better error when mixing up con and def in unquote
[ issue1228 ] more principled checking of name kinds when unquoting
[ issue1228 ] oops, recursive unquoteDecls have no definitions
[issue 938] implement recursive instance search (without termination check)
[ fix-agda-whitespace ] Back-ported to maint-2.4.0
[ cabal ] Updated tested-with field
Fixed whitespace issues
Merge branch 'maint-2.4.0'
Instructions for testing the repository with a new version of GHC
Merge branch 'ghc-releases'
solve constraints with inert right-hand sides

Given a constraint
  _X us == D vs
where D is an inert definition (data/record/var/con) we can solve
  _X := \ xs -> D (_Ys xs)
provided that
  - us are all neutral, to ensure that _X cannot reduce to D
  - none of us have D as head
This is important for instance search where knowing the head D can
enable progress.
updated instance argument examples for recursive search
don't treat constructors as inert

not needed for instance search and it can lead to unsolved metas
(see test/succeed/InertFailure.agda)
[ refactor ] Commented out unused function takenNameStr.
[ refactor ] Removed commented-out code.
[ refactor ] Removed some dead code.