MétaCan
Menu
Back to cohort
Record W1933113537 · doi:10.1109/robot.1987.1087894

Smalltalk as a programming language for robotics?

2005· article· en· W1933113537 on OpenAlexaff
Wilf R. LaLonde, D. G. Thomas, Kent A. Johnson

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsCarleton University
Fundersnot available
KeywordsSmalltalkComputer scienceProgramming languageProgramming language implementationArtificial intelligenceRoboticsFirst-generation programming languageRobotGraphicsObject-oriented programmingProgramming paradigmFifth-generation programming languageHigh-level programming languageExtensible programmingHuman–computer interactionSymbolic programmingComputer graphics (images)

Abstract

fetched live from OpenAlex

Programming languages for robotics applications are continually being developed and extended as the applications become more sophisticated. Language evolution is proceeding along two directions: (1) providing more and better facilities for task-level as opposed to robot-level programming and (2) providing better facilities for simulation, graphics and symbolic manipulation. The trend makes it clear that the full capabilities of a general purpose programming language are needed. Instead of developing a new language from the ground up, it is easier and more productive to take an existing language with all the requisite general purpose facilities and specialize it for robotics. Because of its symbolic processing facilities, its object-oriented nature, its usefulness as a simulation language, and its sophisticated graphical interface, Smalltalk is an ideal candidate for specialization. We discuss in more detail why this is the case and we show how a programming language that approaches the power of AL can be imbedded in Smalltalk within 2-4 person-months of effort.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0050.009
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0070.004

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.014
GPT teacher head0.254
Teacher spread0.240 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations15
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicRobot Manipulation and LearningFrench-language works237,207