MétaCan
Menu
Back to cohort
Record W2395895598 · doi:10.1016/s1571-0661(05)80579-1

Preface

2001· article· en· W2395895598 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueElectronic Notes in Theoretical Computer Science · 2001
Typearticle
Languageen
FieldComputer Science
TopicLogic, programming, and type systems
Canadian institutionsnot available
Fundersnot available
KeywordsProgramming languageComputer scienceMetalanguageSemantics (computer science)Variable (mathematics)Operational semanticsENCODETheoretical computer scienceMathematics

Abstract

fetched live from OpenAlex

Mechanised Reasoning about Languages with Variable Binding 2001 This volume contains the Proceedings of the Workshop on Mechanised Reasoning about Languages with Variable Binding (MERLIN 2001), which was held in conjunction with IJCAR 2001, the International Joint Conference on Automated Reasoning. The Workshop took place in Siena, Italy, on the 18th June 2001, and was organized by the editors of this volume. Currently, there is considerable interest in the use of computers to encode (operational) semantic descriptions of programming languages. Such encodings are often done within the metalanguage of a theorem prover or related system. The encodings may require the use of variable binding constructs, inductive definitions, coinductive definitions, and associated schemes of (co)recursion. The broad aims of MERLIN 2001 were to provide researchers with a forum to review state of the art results and techniques, and to present recent and new progress in the areas of • the automation of the metatheory of programming language semantics, particularly work which involves variable binding; and • theoretical and practical problems of encoding variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. Automating variable binding and its associated properties is notoriously difficult, but such automation pervades the encoding of programming language semantics. Thus theoretical methods and practical techniques which simplify the definition and implementation of such encodings will prove very useful to the community. Ultimately we hope that advances in these areas will have significance for the general programming language community. The papers in this volume were reviewed by the following programme committee: • Simon Ambler (University of Leicester) • Roy Crole (Chair; University of Leicester) • Amy Felty (University of Ottawa) • Andrew Gordon (Microsoft Research, Cambridge) • Furio Honsell (University of Udine) • Tom Melham (University of Glasgow) • Frank Pfenning (Carnegie Mellon University) Alberto Momigliano was the local organizer, and devoted a lot of time to the preparations for MERLIN 2001. The editors would like to thank the other committee members for their input into all stages of the organization of MERLIN 2001, but especially that of reviewing the paper submissions. We thank Andrew Pitts, Cambridge University, for giving an excellent invited talk on A First Order Theory of Names and Binding . We would also like to thank Dieter Hutter, IJCAR Workshop Chair, and Fabio Massacci, IJCAR Conference Chair, who put enormous efforts into the organization of all of the IJCAR Workshops. Finally we thank the authors, participants, and others who contributed to MERLIN 2001.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.969
Threshold uncertainty score0.665

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.010
GPT teacher head0.252
Teacher spread0.242 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it