Image de couverture de livre

Does Task Complexity Moderate the Benefits of Liveness? A Controlled Experiment

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rein, Patrick, Ramson, Stefan, Beckmann, Tom, Hirschfeld, Robert
Format:	Preprint
Publié:	2024
Sujets:	Programming Languages
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Broadening the View of Live Programmers: Integrating a Cross-Cutting Perspective on Run-Time Behavior into a Live Programming Environment
par: Rein, Patrick, et autres
Publié: (2024)

Probing the Design Space: Parallel Versions for Exploratory Programming
par: Beckmann, Tom, et autres
Publié: (2025)

Hybrid Structured Editing: Structures for Tools, Text for Users
par: Beckmann, Tom, et autres
Publié: (2026)

Controllable and Reliable Knowledge-Intensive Task-Oriented Conversational Agents with Declarative Genie Worksheets
par: Joshi, Harshit, et autres
Publié: (2024)

Towards Reliable Benchmarking: A Contamination Free, Controllable Evaluation Framework for Multi-step LLM Function Calling
par: Maekawa, Seiji, et autres
Publié: (2025)

Meerkat: A Distributed Reactive Programming Language with Live Updates
par: Zhong, Heng, et autres
Publié: (2024)

Incremental Live Programming via Shortcut Memoization
par: Kirisame, Marisa, et autres
Publié: (2026)

LiveRec: Prototyping Probes by Framing Debug Protocols
par: Döderlein, Jean-Baptiste, et autres
Publié: (2024)

Which Part of the Heap is Useful? Improving Heap Liveness Analysis
par: Kanvar, Vini, et autres
Publié: (2024)

Parallel Dual-Numbers Reverse AD
par: Smeding, Tom, et autres
Publié: (2022)

From High to Low: Simulating Nondeterminism and State with State
par: Tang, Wenhao, et autres
Publié: (2023)

The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
par: Yuan, Charles, et autres
Publié: (2023)

AuDaLa is Turing Complete
par: Franken, Tom T. P., et autres
Publié: (2024)

Let a Thousand Flowers Bloom: An Algebraic Representation for Edge Graphs
par: Liell-Cock, Jack, et autres
Publié: (2024)

Learning Task Decomposition to Assist Humans in Competitive Programming
par: Wen, Jiaxin, et autres
Publié: (2024)

Discourje: Run-Time Verification of Communication Protocols in Clojure -- Live at Last (Technical Report)
par: Jongmans, Sung-Shik
Publié: (2024)

Task-Based Tensor Computations on Modern GPUs
par: Yadav, Rohan, et autres
Publié: (2025)

Remote Concolic Multiverse Debugging -- Extended Version with Additional Appendices
par: Steevens, Maarten, et autres
Publié: (2026)

A Calculus for Scoped Effects & Handlers
par: Bosman, Roger, et autres
Publié: (2023)

Behavior Trees with Dataflow: Coordinating Reactive Tasks in Lingua Franca
par: Schulz-Rosengarten, Alexander, et autres
Publié: (2024)

Two Approaches for Programming Education in the Domain of Graphics: An Experiment
par: Chiodini, Luca, et autres
Publié: (2025)

Minotaur: A SIMD-Oriented Synthesizing Superoptimizer
par: Liu, Zhengyang, et autres
Publié: (2023)

On the Complexity of Checking Soundness of Natural Reductions (Extended Version)
par: Enea, Constantin, et autres
Publié: (2026)

Parameterized Algorithms and Complexity for Function Merging with Branch Reordering
par: Goharshady, Amir K., et autres
Publié: (2026)

Surveying the Rust Verification Landscape
par: Blanc, Alex Le, et autres
Publié: (2024)

Lessons Learned So Far From a Community Effort to Verify the Rust Standard Library (work-in-progress)
par: Blanc, Alex Le, et autres
Publié: (2025)

Dual-Numbers Reverse AD for Functional Array Languages
par: Smeding, Tom, et autres
Publié: (2025)

Three Subtyping Algorithms for Binary Session Types and their Complexity Analyses
par: Udomsrirungruang, Thien, et autres
Publié: (2024)

Java Classes with "-Er" and "-Utils" Suffixes Have Higher Complexity
par: Sukhova, Anna, et autres
Publié: (2024)

Structural Analysis of GRAFCET Control Specifications
par: Schnakenbeck, Aron, et autres
Publié: (2023)

Validating AI-Generated Code with Live Programming
par: Ferdowsi, Kasra, et autres
Publié: (2023)

Compositional Quantum Control Flow with Efficient Compilation in Qunity
par: Mints, Mikhail, et autres
Publié: (2025)

Inductive diagrams for causal reasoning
par: Castello, Jonathan, et autres
Publié: (2023)

A Pure Demand Operational Semantics with Applications to Program Analysis
par: Smith, Scott, et autres
Publié: (2023)

Crux, a Precise Verifier for Rust and Other Languages
par: Pernsteiner, Stuart, et autres
Publié: (2024)

Three Subtyping Algorithms for Binary Session Types and their Complexity Analyses (full version)
par: Udomsrirungruang, Thien, et autres
Publié: (2024)

Top-Down or Bottom-Up? Complexity Analyses of Synchronous Multiparty Session Types
par: Udomsrirungruang, Thien, et autres
Publié: (2024)

Context-Free Grammar Inference for Complex Programming Languages in Black Box Settings
par: Li, Feifei, et autres
Publié: (2026)

Validation of Modern JSON Schema: Formalization and Complexity
par: Attouche, Lyes, et autres
Publié: (2023)

ALEA IACTA EST: A Declarative Domain-Specific Language for Manually Performable Random Experiments
par: Widemann, Baltasar Trancón y, et autres
Publié: (2025)