Copertina

An instance of FreeCHR with refined operational semantics

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Rechenberger, Sascha, Frühwirth, Thom
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Programming Languages
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

FreeCHR: An Algebraic Framework for CHR-Embeddings
di: Rechenberger, Sascha, et al.
Pubblicazione: (2023)

Optimized Execution of FreeCHR
di: Rechenberger, Sascha, et al.
Pubblicazione: (2025)

A Refined Operational Semantics for FreeCHR
di: Rechenberger, Sascha, et al.
Pubblicazione: (2025)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
di: Fruehwirth, Thom
Pubblicazione: (2023)

Saturating automata for game semantics
di: Dixon, Alex, et al.
Pubblicazione: (2023)

The downgrading semantics of memory safety (Extended version)
di: Hansen, René Rydhof, et al.
Pubblicazione: (2025)

Higher-order bialgebraic semantics
di: Goncharov, Sergey, et al.
Pubblicazione: (2024)

Leveraging LLMs to support co-evolution between definitions and instances of textual DSLs
di: Zhang, Weixing, et al.
Pubblicazione: (2025)

Relaxed exception semantics for Arm-A (extended version)
di: Simner, Ben, et al.
Pubblicazione: (2024)

The generalised distribution semantics and projective families of distributions
di: Weitkämper, Felix
Pubblicazione: (2022)

A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories
di: Kaddar, Younesse, et al.
Pubblicazione: (2023)

Super-Linear Speedup by Generalizing Runtime Repeated Recursion Unfolding in Prolog
di: Fruehwirth, Thom
Pubblicazione: (2025)

Redex -> Coq: towards a theory of decidability of Redex's reduction semantics
di: Soldevila, Mallku, et al.
Pubblicazione: (2024)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
di: Moreau, Vincent, et al.
Pubblicazione: (2023)

Operational methods in semantics
di: Amadio, Roberto M.
Pubblicazione: (2025)

Local Type Inference for Context-Free Session Types
di: Almeida, Bernardo, et al.
Pubblicazione: (2025)

Contrasting Deadlock-Free Session Processes (Extended Version)
di: Jaramillo, Juan C., et al.
Pubblicazione: (2025)

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

Optimization of the Context-Free Language Reachability Matrix-Based Algorithm
di: Muravev, Ilia
Pubblicazione: (2024)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
di: Ye, Kangfeng, et al.
Pubblicazione: (2023)

GPU accelerated program synthesis: Enumerate semantics, not syntax!
di: Berger, Martin, et al.
Pubblicazione: (2025)

Context-Free Grammar Inference for Complex Programming Languages in Black Box Settings
di: Li, Feifei, et al.
Pubblicazione: (2026)

Towards Reliable Benchmarking: A Contamination Free, Controllable Evaluation Framework for Multi-step LLM Function Calling
di: Maekawa, Seiji, et al.
Pubblicazione: (2025)

Free to Move: Reachability Types with Flow-Sensitive Effects for Safe Deallocation and Ownership Transfer
di: Deng, Haotian, et al.
Pubblicazione: (2025)

pSTL-Bench: A Micro-Benchmark Suite for Assessing Scalability of C++ Parallel STL Implementations
di: Laso, Ruben, et al.
Pubblicazione: (2024)

Automatic Generation of Python Programs Using Context-Free Grammars
di: Yamani, Kamel, et al.
Pubblicazione: (2024)

Bounded Model Checking of RISC-V Machine Code with Context-Free-Language Ordered Binary Decision Diagrams
di: Bolotina, Anna, et al.
Pubblicazione: (2025)

Data-Driven Template-Free Invariant Generation
di: Xia, Yuan, et al.
Pubblicazione: (2023)

RIOT-POLICE: An implementation of spatial memory safety for the RIOT operating system
di: Tempel, Sören, et al.
Pubblicazione: (2020)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
di: Schmellenkamp, Marko, et al.
Pubblicazione: (2024)

ReFEree: Reference-Free and Fine-Grained Method for Evaluating Factual Consistency in Real-World Code Summarization
di: Bae, Suyoung, et al.
Pubblicazione: (2026)

HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis
di: Barke, Shraddha, et al.
Pubblicazione: (2024)

StackPilot: Autonomous Function Agents for Scalable and Environment-Free Code Execution
di: Zhao, Xinkui, et al.
Pubblicazione: (2025)

VeriEquivBench: An Equivalence Score for Ground-Truth-Free Evaluation of Formally Verifiable Code
di: Zeng, Lingfei, et al.
Pubblicazione: (2025)

Zoozve: A Strip-Mining-Free RISC-V Vector Extension with Arbitrary Register Grouping Compilation Support (WIP)
di: Xu, Siyi, et al.
Pubblicazione: (2025)

Integration of a systolic array based hardware accelerator into a DNN operator auto-tuning framework
di: Peccia, F. N., et al.
Pubblicazione: (2022)

Constrained Decoding of Diffusion LLMs with Context-Free Grammars
di: Mündler, Niels, et al.
Pubblicazione: (2025)

Dynamic IFC Theorems for Free!
di: Algehed, Maximilian, et al.
Pubblicazione: (2020)

Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
di: Dvir, Yotam, et al.
Pubblicazione: (2025)

Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward
di: Weng, Han, et al.
Pubblicazione: (2025)