MétaCan
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.

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

affno abstractunlabeled
The Clara framework for hybrid typestate analysis
Eric Bodden, Laurie Hendren
2010· article· en· International Journal on Software Tools for Technology Transfer· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
A Tale of Four Grammars
Claudia Casadio, Joachim Lambek
2002· article· en· Studia Logica· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
A database of categories
Michael W. Fleming, Ryan Gunther, Robert Rosebrugh
2003· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
A type-preserving compiler in Haskell
Louis-Julien Guillemette, Stefan Monnier
2008· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Dynamic Programming Algorithms
Jeff Edmonds
2008· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Wellfounded recursion with copatterns
Andreas Abel, Brigitte Pientka
2013· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Loop checks for logic programs with functions
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Contracts for concurrency
Piotr Nienaltowski, Bertrand Meyer, Jonathan S. Ostroff
2008· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Featherweight generic confinement
Alex Potanin, James Noble, Dave Clarke, Robert Biddle
2006· article· en· Journal of Functional Programming· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Probabilistic Predicative Programming
Eric C. R. Hehner
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Demonic Algebra with Domain
Jean-Lou De Carufel, Jules Desharnais
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Modular specification and verification of closures in Rust
Fabian Wolff, Aurel Bílý, Christoph Matheja, Péter Müller, Alexander J. Summers
2021· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Automated Theorem Proving
Monty Newborn
2001· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
venueno affunlabeled
Categories in Control
John C. Baez, Jason Erbele
2015· preprint· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
Beyond contracts for concurrency
Jonathan S. Ostroff, Faraz Torshizi, Hai Feng Huang, Bernd Schoeller
2008· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Formalizing Undefinedness Arising in Calculus
William M. Farmer
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Extension mechanisms in Montana
Danny Soroker, Michael Karasick, John Barton, Deborah H. Streeter
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
A new “feasible” arithmetic
Stephen J. Bellantoni, Martin Hofmann
2002· article· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
Capturing Types
Aleksander Boruch-Gruszecki, Martin Odersky, Edward Lee
2023· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Algebras and Update Strategies
Michael Johnson, Richard J. Wood, Robert Rosebrugh
2020· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Gradual type-and-effect systems
Felipe Bañados Schwerter, Ronald Garcia, Éric Tanter
2016· article· en· Journal of Functional Programming· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Space Complexity in Polynomial Calculus
Massimo Lauria, Jakob Nordstr”öm, Neil Thapen, Noga Ron‐Zewi
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
An Introduction to Proof Theory
Pietro Mancosu, Sergio Galvan, Richard Zach
2021· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Realizability models for BLL-like languages
Martin Hofmann, Philip Scott
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About