• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

steve-downey / overload / 38984258206
67%

Build:
DEFAULT BRANCH: main
Ran 17 Oct 2026 12:01AM UTC
Jobs 1
Files 4
Run time 1min
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

16 Oct 2026 11:59PM UTC coverage: 67.391%. Remained the same
38984258206

push

github

steve-downey
Phase 4: partial ordering and partial specialization matching

Overload/Ordering.lean transcribes [temp.func.order] and
[temp.deduct.partial]: the transformed template with synthesized unique
types and values, deduction per nominated pair with the reference and cv
tie-breaks of /9 read as denials of the opposite direction, at least as
specialized and more specialized by /10, and the gate of
[temp.func.order]/8, under which constraints are compared only for
equal-length parameter lists with equivalent template parameters, where
equivalence ignores type-constraints on placeholder types per
[temp.over.link]/6. Subsumption from [temp.constr.order]/1 and /4 comes
with it, in normal forms, so the gate has something to compare.

Partial specialization matching follows [temp.spec.partial.match] with
the rewrite of [temp.spec.partial.order]/1; it has both forms and the
agreement theorem `patternMatches_iff`. Resolution now orders template
specializations with it, and the program environment selects instances
with it, so an ambiguous lookup is a hard error.

Theorems, audited: more-specialized is irreflexive and asymmetric, and
the tie-break is off for parameter lists of different lengths or with
non-equivalent parameters. Transitivity was searched over 5832 triples
without a counterexample; its proof is owed, as are the relation forms
of ordering and resolution (decisions.md#spec-style).

Emitted cases: the tie-break probe's four variants, the reference and cv
tie-breaks, pointer over value, and three instance selections. Variant C
is a finding: both compilers call the placeholder-constrained pair
ambiguous where the text makes the more constrained overload win.

Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Fh4shuueJZ4uzMSi65oQca

31 of 46 relevant lines covered (67.39%)

0.78 hits per line

Jobs
ID Job ID Ran Files Coverage
1 38984258206.1 17 Oct 2026 12:01AM UTC 4
67.39
GitHub Action Run
Source Files on build 38984258206
  • Tree
  • List 4
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • Github Actions Build #38984258206
  • 97ef9ff8 on github
  • Prev Build on main (#38982185800)
  • Next Build on main (#39080155186)
  • Delete
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE TRIAL · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc