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 5 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Implicit-signal monitors
Peter A. Buhr, Ashif S. Harji
2005· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Mixed linear and non-linear recursive types
Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Uniqueness logic
Dana Harrington
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
MathScheme: Project Description
Jacques Carette, William M. Farmer, Russell O’Connor
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
13
citations
affunlabeled
Handling bidirectional control flow
Yizhou Zhang, Guido Salvaneschi, Andrew C. Myers
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
ASF+SDF parsing tools applied to ELAN
Mark van den Brand, Christophe Ringeissen
2000· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
A Dynamic Operational Semantics for JVML.
Nadia Belblidia, Mourad Debbabi
2007· article· en· The Journal of Object Technology· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
4 THE CATEGORY OF BRATTELI DIAGRAMS
Massoud Amini, George A. Elliott, Nasser Golestani
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Separation Logic with One Quantified Variable
Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Resource Tableaux (extended abstract)
Didier Galmiche, Daniel Méry, David Pym
2002· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
QUANTIFIED MODAL RELEVANT LOGICS
Nicholas Ferenz
2021· article· en· The Review of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Extended static checking in JML4
Perry R. James, Patrice Chalin
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
The Beta-Bernoulli process and algebraic effects
Sam Staton, Dario Stein, Hongseok Yang, Nathanael Ackerman, Cameron E. Freer, Daniel M. Roy
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
The logic of linear functors
Richard Blute, J.R.B. Cockett, R. A. G. Seely
2002· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Programs Using Syntax with First-Class Binders
Francisco Ferreira, Brigitte Pientka
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
SAT-Based Strategy Extraction in Reachability Games
Niklas Eén, Alexander Legg, Nina Narodytska, Leonid Ryzhyk
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
← previousnext →

How this was built: Screen · Findings · About