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

afffundunlabeled
Dependent type systems as macros
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
fundno affunlabeled
Designing types for R, empirically
Alexi Turcotte, Aviral Goel, Filip Křikava, Jan Vítek
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
SpEQ: Translation of Sparse Codes using Equivalences
Avery Laird, Bangtian Liu, Nikolaj Bjørner, Maryam Mehri Dehnavi
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Lexical Effect Handlers, Directly
Cong Ma, Zhaoyi Ge, Edward Lee, Yizhou Zhang
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Formal Foundations for Translational Separation Logic Verifiers
Thibault Dardinier, Michael Sammler, G. Parthasarathy, Alexander J. Summers, Péter Müller
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Staged Compilation with Module Functors
Tsung-Ju Chiang, Jeremy Yallop, Leo White, Ningning Xie
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
AutoVerus: Automated Proof Generation for Rust Code
Chenyuan Yang, X. Li, Md Rakib Hossain Misu, Jianan Yao, Yeyun Gong, Chris Hawblitzel +6 more
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
A Demonic Outcome Logic for Randomized Nondeterminism
Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
Higher Order Bayesian Networks, Exactly
Claudia Faggian, Daniele Pautasso, Gabriele Vanoni
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Fractional resources in unbounded separation logic
Thibault Dardinier, Péter Müller, Alexander J. Summers
2022· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Evolution of Emacs Lisp
Stefan Monnier, Michael Sperber
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
DProf: distributed profiler with strong guarantees
Zachary Benavides, Keval Vora, Rajiv Gupta
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Indexed Types for a Statically Safe WebAssembly
Adam T. Geller, J. Ray Frank, William J. Bowman
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
4
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
machine 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
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
How to Bake a Quantum Π
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Zero-Overhead Lexical Effect Handlers
Cong Ma, Zhaoyi Ge, Yizhou Zhang
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Compiling with Generating Functions
Jianlin Li, Yizhou Zhang
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Grafs: declarative graph analytics
Farzin Houshmand, Mohsen Lesani, Keval Vora
2021· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Practical Type Inference with Levels
Andong Fan, Han Xu, Ningning Xie
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Message-Observing Sessions
Ryan Kavanagh, Brigitte Pientka
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
McTT: A Verified Kernel for a Proof Assistant
Junyoung Jang, Antoine Gaulin, Jason Z. S. Hu, Brigitte Pientka
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About