Cover Image

From Dynamic to Lexical: A Comparative Exploration of Scoping Rules in SAS and R

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ling, Chen, Wang, Yachen
Format:	Preprint
Published:	2026
Subjects:	Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lazy Evaluation: A Comparative Analysis of SAS MACROs and R Functions
by: Ling, Chen, et al.
Published: (2026)

Spegion: Implicit and Non-Lexical Regions with Sized Allocations
by: Hughes, Jack, et al.
Published: (2025)

A Calculus for Scoped Effects & Handlers
by: Bosman, Roger, et al.
Published: (2023)

Handling Scope Checks (Extended Version)
by: Lee, Michael, et al.
Published: (2026)

Online Collection Statistics: A Comparison of BASIC and SAS.
by: Slater, Jack
Published: (1981)

Taming Scope Extrusion in Gradual Imperative Metaprogramming
by: Chen, Tianyu, et al.
Published: (2026)

Defining Name Accessibility using Scope Graphs (Extended Edition)
by: Zwaan, Aron, et al.
Published: (2024)

Free Foil: Generating Efficient and Scope-Safe Abstract Syntax
by: Kudasov, Nikolai, et al.
Published: (2024)

Rule-Based Error Classification for Analyzing Differences in Frequent Errors
by: Shirafuji, Atsushi, et al.
Published: (2023)

Is Next Token Prediction Sufficient for GPT? Exploration on Code Logic Comprehension
by: Qi, Mengnan, et al.
Published: (2024)

PAuth - Precise Task-Scoped Authorization For Agents
by: Sharma, Reshabh K, et al.
Published: (2026)

Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

CodePod: A Language-Agnostic Hierarchical Scoping System for Interactive Development
by: Li, Hebi, et al.
Published: (2023)

From Monolithic to Compositional: A Compositional Operational Semantics for Crystality
by: Xu, Ziyun, et al.
Published: (2026)

SAS: Simulated Attention Score
by: Zheng, Chuanyang, et al.
Published: (2025)

Rebound: Efficient, Expressive, and Well-Scoped Binding
by: De Santo, Noé, et al.
Published: (2025)

Reverse Chain: A Generic-Rule for LLMs to Master Multi-API Planning
by: Zhang, Yinger, et al.
Published: (2023)

From Algebraic Word Problem to Program: A Formalized Approach
by: Wiemerslage, Adam, et al.
Published: (2020)

RefineStat: Efficient Exploration for Probabilistic Program Synthesis
by: Kanda, Madhav, et al.
Published: (2025)

Code Repair with LLMs gives an Exploration-Exploitation Tradeoff
by: Tang, Hao, et al.
Published: (2024)

Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification
by: Fukuda, Kota, et al.
Published: (2025)

Scoped Effects as Parameterized Algebraic Theories
by: Matache, Cristina, et al.
Published: (2024)

From Traces to Program Incorrectness: A Type-Theoretic Approach
by: Yuan, Yongwei, et al.
Published: (2025)

Sound State Encodings in Translational Separation Logic Verifiers (Extended Version)
by: Ling, Hongyi, et al.
Published: (2026)

Deegen: A JIT-Capable VM Generator for Dynamic Languages
by: Xu, Haoran, et al.
Published: (2024)

Scoped and Typed Staging by Evaluation
by: Allais, Guillaume
Published: (2023)

CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis
by: Tunç, Hünkar Can, et al.
Published: (2024)

From Program Logics to Language Logics
by: Cimini, Matteo
Published: (2024)

Practical Algebraic Stepping with Scoped Filters
by: Fei, Haoxiang, et al.
Published: (2026)

Text2Mem: A Unified Memory Operation Language for Memory Operating System
by: Wang, Yi, et al.
Published: (2025)

Beyond the Phase Ordering Problem: Finding the Globally Optimal Code w.r.t. Optimization Phases
by: Wang, Yu, et al.
Published: (2024)

Wasm-R3: Record-Reduce-Replay for Realistic and Standalone WebAssembly Benchmarks
by: Baek, Doehyun, et al.
Published: (2024)

From High to Low: Simulating Nondeterminism and State with State
by: Tang, Wenhao, et al.
Published: (2023)

Partial Orders for Precise and Efficient Dynamic Deadlock Prediction
by: Heuvel, Bas van den, et al.
Published: (2025)

From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms
by: Kobaladze, Zurabi, et al.
Published: (2025)

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees
by: Zhang, Guanqin, et al.
Published: (2025)

Dynamic Robustness Verification Against Weak Memory (Extended Version)
by: Margalit, Roy, et al.
Published: (2025)

Generating Inputs for Grammar Mining using Dynamic Symbolic Execution
by: Pointner, Andreas, et al.
Published: (2025)

Modeling Dynamic (De)Allocations of Local Memory for Translation Validation
by: Rose, Abhishek, et al.
Published: (2024)

Probabilistic Inference for Datalog with Correlated Inputs
by: Wang, Jingbo, et al.
Published: (2025)