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 1 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
Scaling Java Points-to Analysis Using Spark
Ondřej Lhoták, Laurie Hendren
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
430
citations
afffundno abstractunlabeled
The TXL source transformation language
James R. Cordy
2006· article· en· Science of Computer Programming· Computer Science
machine prediction:candidate · noneconsensus · none
358
citations
affunlabeled
A brief history of just-in-time
John Aycock
2003· review· en· ACM Computing Surveys· Computer Science
machine prediction:candidate · noneconsensus · none
333
citations
affunlabeled
Revised <sup>6</sup> Report on the Algorithmic Language Scheme
Michael Sperber, R. Kent Dybvig, Matthew Flatt, ANTON VAN STRAATEN, Robby Findler, Jacob Matthews
2009· article· en· Journal of Functional Programming· Computer Science
machine prediction:candidate · noneconsensus · none
325
citations
affunlabeled
Practical virtual method call resolution for Java
Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, Étienne Gagnon +1 more
2000· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
290
citations
affunlabeled
Contextual modal type theory
Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka
2008· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
263
citations
affno abstractunlabeled
Theorem Proving Modulo
Gilles Dowek, Thérèse Hardin, Claude Kirchner
2003· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
214
citations
affunlabeled
A.: Why3: Shepherd your herd of provers
François Bobot, Jean-Christophe Filliâtre, Claude Marché, Andrei Paskevich
2011· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
186
citations
affunlabeled
Kleene algebra with domain
Jules Desharnais, Bernhard Möller, Georg Struth
2006· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
173
citations
afffundunlabeled
Pick your contexts well
Yannis Smaragdakis, Martin Bravenboer, Ondřej Lhoták
2011· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
167
citations
affunlabeled
General Recursion via Coinductive Types
Venanzio Capretta
2005· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
140
citations
affaboutunlabeled
The knowledge complexity of interactive proof-systems
Shafi Goldwasser, Silvio Micali, Chales Rackoff
2019· book-chapter· en· Association for Computing Machinery eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
134
citations
affno abstractunlabeled
DSL Implementation in MetaOCaml, Template Haskell, and C++
Krzysztof Czarnecki, John T. O’Donnell, Jörg Striegnitz, Walid Taha
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
112
citations
affno abstractunlabeled
Invariant Synthesis for Combined Theories
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
fundno affunlabeled
A new proof rule for almost-sure termination
Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen
2017· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
98
citations
afffundunlabeled
Differential categories
Richard Blute, J.R.B. Cockett, R. A. G. Seely
2006· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
93
citations
affunlabeled
Modelling general recursion in type theory
Ana Bove, Venanzio Capretta
2005· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
affunlabeled
Generic ownership for generic Java
Alex Potanin, James Noble, Dave Clarke, Robert Biddle
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
84
citations
afffundunlabeled
Foundations of Typestate-Oriented Programming
Ronald Garcia, Éric Tanter, Roger Wolff, Jonathan Aldrich
2014· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
Higher type recursion, ramification and polynomial time
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
2000· article· en· Annals of Pure and Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
afffundno abstractunlabeled
Hybrid
Amy Felty, Alberto Momigliano
2010· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
The seven virtues of simple type theory
William M. Farmer
2007· article· en· Journal of Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
affunlabeled
Practical virtual method call resolution for Java
Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, Étienne Gagnon +1 more
2000· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affno abstractunlabeled
Canonical conditional rewrite systems
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
Practical Extensions to the IFDS Algorithm
Nomair A. Naeem, Ondřej Lhoták, Jonathan Rodriguez
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
A calculus of functional BSP programs
Frédéric Loulergue, Gaétan Hains, Christian Foisy
2000· article· en· Science of Computer Programming· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
affno abstractunlabeled
Coordination through Channel Composition
Farhad Arbab, Farhad Mavaddat
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
afffundunlabeled
PolyTOIL
Kim B. Bruce, Angela Schuett, R. H. van Gent, Adrian Fiech
2003· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
A Reachability Predicate for Analyzing Low-Level Software
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamarić
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
fundno affno abstractunlabeled
A Framework for Optimizing Java Using Attributes
Patrice Pominville, Feng Qian, Raja Vallée-Rai, Laurie Hendren, Clark Verbrugge
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
Monotone simulations of non-monotone proofs
Albert Atserias, Nicola Galesi, Pavel Pudlák
2002· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affunlabeled
The development of CASC
Francis Jeffry Pelletier, Geoff Sutcliffe, Christian Suttner
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
next →

How this was built: Screen · Findings · About