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 6 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
The logic of message-passing
J.R.B. Cockett, Craig Pastro
2009· article· en· Science of Computer Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Evolving TXL
Adrian D. Thurston, James R. Cordy
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Polymorphic specialization for ML
Simon Helsen, Peter Thiemann
2004· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A methodology for programming with concurrency
Christian Lengauer, Eric C. R. Hehner
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
afffundunlabeled
Indexed codata types
David Thibodeau, Andrew Cave, Brigitte Pientka
2016· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affunlabeled
The dataflow pointcut
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, Mourad Debbabi, Prabir Bhattacharya
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Multi-level Contextual Type Theory
2011· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Formalization of Complex Vectors in Higher-Order Logic
Sanaz Khan Afshar, Vincent Aravantinos, Osman Hasan, Sofiène Tahar
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundunlabeled
A type-and-effect system for object initialization
Fengyun Liu, Ondřej Lhoták, Aggelos Biboudis, Paolo G. Giarrusso, Martin Odersky
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
JASMine: Accessing Java Code from CoreASM
Vincenzo Gervasi, Roozbeh Farahbod
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
8
citations
afffundunlabeled
Dependent type systems as macros
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Induction for innermost and outermost ground termination
Isabelle Gnaedig, Claude Kirchner, Olivier Fissore
2001· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Proof Spaces for Unbounded Parallelism
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2015· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Products in categories of relations
Michael Winter
2007· article· en· The Journal of Logic and Algebraic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Monitorability over Unreliable Channels
Sean Kauffman, Klaus Havelund, Sebastian Fischmeister
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affunlabeled
Smtlink 2.0
2018· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
← previousnext →

How this was built: Screen · Findings · About