Alternative UX Extensions and Their Trade-offs for Code Completion in Pharo

• URL: http://arxiv.org/abs/2607.24253v1
• Date: Mon, 27 Jul 2026 10:42:53 GMT
• Title: Alternative UX Extensions and Their Trade-offs for Code Completion in Pharo
• Abstract summary: Complishon is Pharo's context-aware code completion engine.<n>This paper presents four extensions that address these limits.<n>For each extension, we describe the implementation, discuss alternative designs, and explain the trade-offs involved.
• Score: 0.13381749415517016
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Complishon is Pharo's context-aware code completion engine, built on AST analysis, lazy candidate generation, and filter-based candidate selection. Its existing design already provides strong semantic completion, but several practical limits remain. Strict prefix matching is sensitive to small typing errors, framework prefixes often force redundant input, large completion menus are difficult to scan, and prefix-only matching does not support common camel-case abbreviations. This paper presents four extensions that address these limits: typo tolerance, implicit prefix expansion, grouped completion entries, and camel-case matching. For each extension, we describe the implementation, discuss alternative designs, and explain the trade-offs involved. The main contribution of the paper is to show that these improvements can be integrated into Complishon while preserving its modular architecture and predictable behavior.

Related papers

• Rethinking Item Tokenization in Generative Recommenders: From Fixed Atoms to Semantic Subwords [50.621722853036005]
  In generative recommender systems, items are typically tokenized into fixed-length semantic ID sequences for autoregressive next-item prediction.<n>For user-context modeling, this fine-grained representation triggers Intra-item Attention Overload.<n>We propose Semantic Subword Tokenization (SST), which represents historical items as variable-length semantic subwords.
  arXiv  Detail & Related papers  (2026-08-24T02:42:51Z)
• Code as Representation: A Compilable Parsing Paradigm for Academic Documents [50.40789738182074]
  Compilable Academic Document Parsing (CADP) is a paradigm that reconstructs a full page as contextual La plus executable Python.<n>We introduce CADP-Bench, an expert-verified benchmark of full academic pages containing text and multiple SAE types.<n>Results show that even frontier models still struggle to produce high-fidelity executable reconstructions.
  arXiv  Detail & Related papers  (2026-08-18T09:10:43Z)
• Weave of Formal Thought [51.56484100374058]
  We introduce Weave of Formal Thought (WoFT), a paradigm uniting rigorous syntactic validation with learned structural representations.<n>We present a latent-variable fine-tuning method training the language model to interleave non-terminal grammar symbols directly into generation.<n>For Python, fine-tuning StarCoder2-3B with our RWS objective reduces per-token cross-entropy by 14.3% relative to a text-only SFT baseline.
  arXiv  Detail & Related papers  (2026-06-24T15:58:11Z)
• Compiling Rewrite Rules to Finite-State Transducers with the Worsening Trick [9.436197391132227]
  This paper presents a compact compilation scheme based on the "worsening trick"<n>It generates all legal rewrite candidates, then filter candidates that are worse than another candidate for the same input.<n>The resulting formulas are short and uniform, and where semantics coincide, they reproduce the same rule transducers as earlier approaches.
  arXiv  Detail & Related papers  (2026-06-08T18:36:39Z)
• Prefix Parsing is Just Parsing [53.010152712125766]
  Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar.<n>We introduce the prefix grammar transformation, an efficient reduction of prefix parsing to ordinary parsing.<n>We also present a strategy-based on algorithmic differentiation-for computing the next-token weight vector.
  arXiv  Detail & Related papers  (2026-04-23T01:20:40Z)
• Parser-Oriented Structural Refinement for a Stable Layout Interface in Document Parsing [23.497081928689525]
  We introduce a lightweight structural refinement stage between a DETR-style detector and the interface to stabilize the interface.<n>Treating raw detector outputs as a compact hypothesis pool, the proposed module performs set-level reasoning over query features, semantic cues, box geometry, and visual evidence.<n>From a shared refined structural state, it jointly determines instance retention, refines box localization, and predicts input order before handoff.<n>Extensive experiments on public benchmarks show that our method consistently improves page-level layout quality.
  arXiv  Detail & Related papers  (2026-04-03T03:36:36Z)
• Subtyping in DHOL -- Extended preprint [0.0]
  Recently introduced dependent typed higher-order logic (DHOL) offers compromise between expressiveness and automation support.<n>We leverage this design to extend DHOL with refinement and quotient types.<n>We present the syntax, semantics, and translation to HOL for the extended language.
  arXiv  Detail & Related papers  (2025-07-03T17:59:00Z)
• Neuro-Symbolic Query Compiler [57.78201019000895]
  This paper presents QCompiler, a neuro-symbolic framework inspired by linguistic grammar rules and compiler design, to bridge this gap.<n>It theoretically designs a minimal yet sufficient Backus-Naur Form (BNF) grammar $G[q]$ to formalize complex queries.<n>The atomicity of the sub-queries in the leaf ensures more precise document retrieval and response generation, significantly improving the RAG system's ability to address complex queries.
  arXiv  Detail & Related papers  (2025-05-17T09:36:03Z)
• Type-Constrained Code Generation with Language Models [51.03439021895432]
  We introduce a type-constrained decoding approach that leverages type systems to guide code generation.<n>For this purpose, we develop novel prefix automata and a search over inhabitable types, forming a sound approach to enforce well-typedness on LLM-generated code.<n>Our approach reduces compilation errors by more than half and significantly increases functional correctness in code synthesis, translation, and repair tasks.
  arXiv  Detail & Related papers  (2025-04-12T15:03:00Z)
• Token Alignment via Character Matching for Subword Completion [34.76794239097628]
  This paper examines a technique to alleviate the tokenization artifact on text completion in generative models. The method, termed token alignment, involves backtracking to the last complete tokens and ensuring the model's generation aligns with the prompt.
  arXiv  Detail & Related papers  (2024-03-13T16:44:39Z)
• Outline, Then Details: Syntactically Guided Coarse-To-Fine Code Generation [61.50286000143233]
  ChainCoder is a program synthesis language model that generates Python code progressively. A tailored transformer architecture is leveraged to jointly encode the natural language descriptions and syntactically aligned I/O data samples.
  arXiv  Detail & Related papers  (2023-04-28T01:47:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.