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
Proceedings of the ACM on Programming Languages
Topic
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.

133 results · 1 filter active ·
Results by year
20172025
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.
133 works in the cohort · of 4,299,418page 3 of 3

Labels cover 0 of 133 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 133 of 133 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
Handling the Selection Monad
Gordon Plotkin, Ningning Xie
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A simple soundness proof for dependent object types
Marianna Rapoport, Ifaz Kabir, Paul He, Ondřej Lhoták
2017· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Saggitarius: A DSL for Specifying Grammatical Domains
Anders Miltner, Devon Loehr, A.C. Mong, Kathleen Fisher, David Walker
2023· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Intensional Functions
Zachary Palmer, Nathaniel Wesley Filardo, Ke Wu
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Data flow refinement type inference
Zvonimir Pavlinovic, Yusen Su, Thomas Wies
2021· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
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
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Type-Preserving Flat Closure Optimization
Adam T. Geller, Sean Bocirnea, Chester J. F. Gould, Paulette Koronkevich, William J. Bowman
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Flix: A Design for Language-Integrated Datalog
Magnus Madsen, Ondřej Lhoták
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Qualified Types with Boolean Algebras
Edward Lee, Jonathan Lindegaard Starup, Ondřej Lhoták, Magnus Madsen
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Float Self-Tagging
Olivier Melançon, Manuel Serrano, Marc Feeley
2025· article· en· Proceedings of the ACM on Programming Languages· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Rich specifications for Ethereum smart contract verification
Christian Bräm, Marco Eilers, Péter Müller, Robin Sierra, Alexander J. Summers
2021· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Multi-stage Programming with Splice Variables
Tsung-Ju Chiang, Ningning Xie
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Certified Compilers à la Carte
Oghenevwogaga Ebresafe, Ian Zhao, Ende Jin, Charles Jian, Yizhou Zhang
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Initializing Global Objects: Time and Order
Fengyun Liu, Ondřej Lhoták, David Hua, Enze Xing
2023· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Verifying concurrent multicopy search structures
Nisarg Patel, Siddharth Krishna, Dennis Shasha, Thomas Wies
2021· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Parallel Algebraic Effect Handlers
Ningning Xie, Daniel Johnson, Dougal Maclaurin, Adam Paszke
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About