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
Author
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 10 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.

affno abstractunlabeled
Automated Deduction in Ring Theory
R. Padmanabhan, Yang Zhang
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundunlabeled
ιDOT: a DOT calculus with object initialization
Ifaz Kabir, Yu-Feng Li, Ondřej Lhoták
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Indexed codata types
David Thibodeau, Andrew Cave, Brigitte Pientka
2016· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Outermost ground termination - Extended version
Olivier Fissore, Isabelle Gnaedig, Claude Kirchner
2002· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Is sized typing for Coq practical?
Jonathan Chan, YUFENG LI, William J. Bowman
2023· article· en· Journal of Functional Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Verification Rules for Exception Handling in Eiffel
Emil Sekerinski, Tian Zhang
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Adding structure to monoids
Mario BlaĚević
2013· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Zero-Overhead Lexical Effect Handlers
Cong Ma, Zhaoyi Ge, Yizhou Zhang
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Blame for Null
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
venueno affunlabeled
Introduction to Coalgebra
Jiřı́ Adámek
2005· article· en· Theory and applications of categories· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
An extended view of the Chu-construction
Jürgen Koslowski
2006· article· en· Theory and applications of categories· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Anchoring modularity in HTML.
Claude Kirchner, Anderson Santana de Oliveira
2005· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Rewriting Calculus
Horatiu Cirstea, Claude Kirchner
2000· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
PRIMITIVE TYPES CONSIDERED HARMFUL
Sherman R. Alpert
2000· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
The complexity of analytic tableaux
Noriko Arai, Toniann Pitassi, Alasdair Urquhart
2006· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Certifying cost annotations in compilers
Roberto M. Amadio, Nicolas Ayache, Yann Régis-Gianas, Ronan Saillard
2010· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Simple Type Theory
William M. Farmer
2023· book· en· Computer science foundations and applied logic· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
2
citations
afffundunlabeled
Logic programming
Verónica Dahl, Diana Cukierman, Gemma Bel-Enguix, M. Dolores Jiménez‐López
2010· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A New Definitional Specification Language
Abdesselam Redouane
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Programming Paradigm Driven Heap Analysis
Mark Marron, Ondřej Lhoták, Anindya Banerjee
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About