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 9 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
Sequent Calculus Viewed Modulo
Eric Deplagne
2000· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Evidence normalization in System FC
Dimitrios Vytiniotis, Simon Peyton Jones
2013· article· en· Rewriting Techniques and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
fundno affno abstractunlabeled
Parameter-free polymorphic types
Klaus Aehlig
2008· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Convergence: Integrating termination and abort-freedom
Nafi Diallo, Wided Ghardallou, Jules Desharnais, Ali Mili
2018· article· en· Journal of Logical and Algebraic Methods in Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
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
affno abstractunlabeled
Translating Alloy and extensions to classical B
Sebastian Krings, Michaël Leuschel, Joshua Schmidt, David C. Schneider, Marc Frappier
2019· article· en· Science of Computer Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Type invariants for Haskell
Tom Schrijvers, Louis-Julien Guillemette, Stefan Monnier
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A Low-Level Look at A-Normal Form
William J. Bowman
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Focusing on Refinement Typing
Dimitrios J. Economou, Neel Krishnaswami, Jana Dunfield
2023· article· en· ACM Transactions on Programming Languages and Systems· 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
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
Compiling contextual objects
Francisco Ferreira, Stefan Monnier, Brigitte Pientka
2013· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Calculating threesomes, with blame
Ronald Garcia
2013· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Latest News about Demonic Algebra with Domain
Jean-Lou De Carufel, Jules Desharnais
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Compact Inverse Categories
Robin Cockett, Chris Heunen
2023· book-chapter· en· Outstanding contributions to logic· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Concurrent Programming using Umple
Mahmoud Husseini Orabi, Ahmed Husseini Orabi, Timothy C. Lethbridge
2018· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Towards a Pragmatic Mereology
Ryszard Janicki, Dai Le
2007· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · 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
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
affunlabeled
Accelerating N-queens problem using OpenMP
Alan Ayala, Hussein Al Osman, Daniel Shapiro, John-Marc Desmarais, Jonathan Parri, Miodrag Bolić +1 more
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lenient evaluation and parallelism
Guy Tremblay, B. Malenfant
2000· article· en· Computer Languages· Computer Science
distilled prediction:candidate · noneconsensus · 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
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
← previousnext →

How this was built: Screen · Findings · About