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 17 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.

aboutno affunlabeled
Preface
Richard Blute, Peter Selinger
2003· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Micropygomyia (Coquillettimyia) vexator
2022· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
A demand-driven adaptive type analysis
Danny Dubé, Marc Feeley
2002· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Armstrong Axioms
Solmaz Kolahi
2018· book-chapter· en· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affunlabeled
Abstract Data Types
Don A. Cowan, Paulo S. C. Alencar
2008· other· en· Wiley Encyclopedia of Computer Science and Engineering· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Biform Theories: Project Description
Jacques Carette, William M. Farmer, Yasmine Sharoda
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Armstrong Axioms
Solmaz Kolahi
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
De nouveaux outils pour calculer avec des inductifs en Coq
Pierre Boutillier
2014· dissertation· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
A Hyprolog Parsing Methodology for Property Grammars
Verónica Dahl, Baohua Gu, Erez Maharshak
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affvenueunlabeled
Chemistry in space
2017· article· en· NPARC· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
<font>Q</font>-WALLS TO <font>Q</font>-BALLS
R. MacKENZIE, M. B. Paranjape
2001· article· yi· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · metaepi_narrow+insufficient_payload
0
citations
afffundunlabeled
Type Universes as Kripke Worlds
Paulette Koronkevich, William J. Bowman
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Distributive rewriting calculus
Horatiu Cirstea, Clément Houtmann, Benjamin Wack
2006· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Multi-level Contextual Type Theory
Mathieu Boespflug, Brigitte Pientka
2011· article· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Expressions for D*
Arnold Daniels
2010· book-chapter· en· SPIE eBooks· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Construction schemes: Transferring structures from ω to ω1
Jorge Antonio Cruz Chapital, Osvaldo Guzmán González, Stevo Todorčević
2025· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Categories
Jean‐Pierre Marquis
2018· book-chapter· en· Springer undergraduate texts in philosophy· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Towards the Theory of Relaxed Unification
Tony Abou-Assaleh, Nick Cercone, Vlado Kešelj
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Proof Translations in BI Logic
Didier Galmiche, Michel Marti, Daniel Méry
2018· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Induction for weak termination
Isabelle Gnaedig, Olivier Fissore, Claude Kirchner
2002· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Packrats parse in packs
Mario Blažević, Jacques Légaré
2017· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Towards a Methodology for Rule-Based Programming
Carlos Castro, Claude Kirchner
2002· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Universality of proofs
Gilles Dowek, Catherine Dubois, Brigitte Pientka, Florian Rabe
2017· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On-demand documentation via code examples
2024· dissertation· en· eScholarship@McGill (McGill)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Support Ordered Resolution
Bruce Spencer, Joseph D. Horton
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About