MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
→
Sort
Language
Type
Field
Venue
Topic
Logic, programming, and type systems
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

928 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
928 works in the cohort · of 4,299,418page 2 of 19

Labels cover 1 of 928 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 928 of 928 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Introduction to linear bicategories
2000· article· en· Mathematical Structures in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Elementary logic programs
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
43
citations
affunlabeled
Fair reactive programming
2014· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
38
citations
affunlabeled
The rewriting calculus - part II
2001· article· en· Logic Journal of IGPL· Computer Science
distilled prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Concrete Types for TypeScript
2015· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
36
citations
afffundunlabeled
Fifty Years of Prolog and Beyond
2022· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
fundno affno abstractunlabeled
Syntactic control of concurrency
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Universe Polymorphism in Coq
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
35
citations
fundno affunlabeled
Encapsulating objects with confined types
2007· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
34
citations
fundno affno abstractunlabeled
Taut Monads and T0-spaces
2002· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
33
citations
affunlabeled
The lambda calculus is algebraic
2002· article· en· Journal of Functional Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Flux: Liquid Types for Rust
2023· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affunlabeled
Automated Certified Proofs with CiME3
2011· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
29
citations
affunlabeled
Termination in Modal Kleene Algebra
2006· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
28
citations
affno abstractunlabeled
telingo = ASP + Time
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
27
citations
affunlabeled
Modelling session types using contracts
2014· article· en· Mathematical Structures in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
← previousnext →

How this was built: Screen · Findings · About