MétaCan
Menu
Back to cohort
Record W4392906074 · doi:10.32920/25412854

A Combinator, N-dimensional Array Library in Smalltalk

2024· preprint· en· W4392906074 on OpenAlexaff
Conor Hoekstra

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicLogic, programming, and type systems
Canadian institutionsToronto Metropolitan UniversitySimon Fraser University
FundersDirektoratet for internasjonalisering og kvalitetsutvikling i høgare utdanning
KeywordsCombinatory logicSmalltalkProgramming languageComputer scienceLogic programmingObject-oriented programming

Abstract

fetched live from OpenAlex

<p>My thesis is that programming in array languages with combinators (from Combinatory Logic) is a powerful and important aspect of programming and that it can naturally fit into an object-oriented language like Smalltalk. Evidence for this is provided by an experimental implementation of a combinator, n-dimensional array library in Smalltalk. A component of this thesis is a survey of combinatory logic and combinators as they currently exist in modern array programming languages and a study of what makes them so powerful and expressive.</p>

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.

How this classification was reachedexpand

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
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.948
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

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

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.020
GPT teacher head0.236
Teacher spread0.215 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicLogic, programming, and type systemsFrench-language works237,207