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 4 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
An Introduction to Proof Theory
Pietro Mancosu, Sergio Galvan, Richard Zach
2021· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
The complexity of resolution refinements
Joshua Buresh-Oppenheim, Toniann Pitassi
2007· article· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Directly-Executable Earley Parsing
John Aycock, Nigel Horspool
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Introducing HOL Zero
Mark Adams
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Inductive Beluga: Programming Proofs
Brigitte Pientka, Andrew Cave
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
CATEGORIES AS ALGEBRA, II
Benjamin Steinberg, Bret Tilson
2003· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Higher-Order Logic and Type Theory
John Bell
2022· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
aboutno affunlabeled
Probabilistic Guarded Commands Mechanized in HOL
Joe Hurd, Annabelle McIver, Carroll Morgan
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Umple
Omar Badreddin
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Abstract Models of Storage
R. D. Tennent, Dan R. Ghica
2000· article· en· LISP and Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Towards a typed Geometry of Interaction
Esfandiar Haghverdi, Philip Scott
2010· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
The IJCAR ATP System Competition
Geoff Sutcliffe, Christian Suttner, Francis Jeffry Pelletier
2002· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
On Formal Methods Thinking in Computer Science Education
Brijesh Dongol, Catherine Dubois, Stefan Hallerstede, Eric C. R. Hehner, Carroll Morgan, Péter Müller +4 more
2024· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Pregroups and natural language processing
Joachim Lambek
2006· article· en· The Mathematical Intelligencer· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
A relational model of non-deterministic dataflow
Thomas Hildebrandt, Prakash Panangaden, Glynn Winskel
2004· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
High-Level Theories
Jacques Carette, William M. Farmer
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
MacoCaml: Staging Composable and Compilable Macros
Ningning Xie, Leo White, Olivier Nicole, Jeremy Yallop
2023· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
OOMatch
Adam Richard, Ondřej Lhoták
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
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
Abstracting gradual typing
Ronald Garcia, Alison M. Clark, Éric Tanter
2016· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Theory Presentation Combinators
Jacques Carette, Russell O’Connor
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Valuations of terms
Klaus Denecke, Shelly L. Wismath
2003· article· en· Algebra Universalis· 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
← previousnext →

How this was built: Screen · Findings · About