ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Operational semantics”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.PLTheoreticalRecentJun 19, 2026

Correct and Complete Symbolic Execution for Free

Erik Voogd, Einar Broch Johnsen, Åsmund Aqissiaq Arild Kløvstad, Jurriaan Rot +1 more

This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.

View →
cs.PLTheoreticalRecentJun 18, 2026

Big-step and small-step Horn clause derivations applied to operational semantics

John P. Gallagher, Manuel Hermenegildo, José Morales, Pedro Lopez-Garcia +1 more

The paper proves equivalence between big-step and small-step derivations for Horn clauses and transforms Horn clauses into equivalent sets of clauses based on the given derivation strategy.

View →
cs.PLTheoreticalRecentOct 20, 2026

Record Types Everywhere

Matthew Toohey, Ara Jamalzadeh, Ningning Xie

A novel calculus is introduced that models first-class environments and function application using standard record types.

View →
cs.PLTheoreticalRecentJun 12, 2026

Formal Semantics and Type System for Vega Data Transformations

Kristýna Petrlíková, Tomas Petricek

This paper defines a graph-based operational semantics and type system for Vega, a declarative language for creating interactive data visualizations.

View →
cs.PLTheoreticalRecentOct 27, 2026

Polymorphic First-Class Environments

Jinhao Tan, Jam Kabeer Ali Khan, Bruno C. d. S. Oliveira

This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.

View →
cs.PLcs.LOTheoreticalRecentJun 22, 2026

Cyclic Graphs and Memoization in Pure $λ$-Calculus

Bo Yang

The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.

View →
cs.PLTheoreticalRecentOct 16, 2026

Arbitrary Functors as Modalities in a Linear Calculus

Jean-Philippe Bernardy, Andreas Abel

This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.

View →
cs.AIEmpiricalRecentOct 20, 2026

Semantic Observability for Autonomous Systems Diagnostics

Jitendra Solanki, Anand Todkar, Ziran Min

This paper introduces Semantic Observability, a framework that unifies disparate log streams into a dynamic, queryable Property Graph Database to isolate root causes during cascading failures.

View →
cs.PLTheoreticalRecentOct 10, 2026

Mechanising Denotational Semantics in Agda

Peter D. Mosses, Jesper Cockx, Bernhard Reus

Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.

View →
cs.AIRecentJun 1, 2026

An Abstract Worlds Semantic Framework for Belief Change Operators

Daniel Grimaldi, M. Vanina Martinez, Ricardo O. Rodriguez

The paper introduces Abstract Worlds Semantics (AWS), a set-theoretic framework that treats worlds as primitive elements to provide a unified and generalized analysis of various belief change models.

View →
cs.AIcs.NETheoreticalRecentAug 16, 2026

Mental Model Management: An Operator-Based Framework for LLM Memory

Oliver Kramer

The paper introduces Mental Model Management (3M), a framework for representing knowledge as compact mental models and continuously integrating new information.

View →
cs.AIcs.LGcs.LOEmpiricalRecentJun 17, 2026

NeSyCat Torch: A Differentiable Tensor Implementation of Categorical Semantics for Neurosymbolic Learning

Daniel Romero Schellhorn, Till Mossakowski, Björn Gehrke

NeSyCat is extended to include neural networks for learning predicates and functions, improving performance and accuracy.

View →
cs.LOcs.PLTheoreticalRecentJun 12, 2026

Syntax and semantics of focalisation with relative monads and comonads

Éléonore Mangel, Paul-André Melliès, Guillaume Munch-Maccagnoni

This paper studies the use of logical principles to design well-behaved term syntaxes for sequent calculus in effectful computation.

View →
cs.PLcs.AIRecentMay 29, 2026

SEMBridge: Tagless-Final Program Semantics with Weakest-Precondition and Bounded-Checking Interpretations

Eric Liang

SEMBridge is a tagless-final framework that allows a single executable object program to generate multiple program semantics, including weakest-precondition and bounded-checking interpretations, ensur…

View →
cs.PLTheoreticalRecentOct 30, 2026

Iris on Indirection Theory: Lightweight Higher-order Ghost State

Darius Foo, Viet-Anh Nguyen, Wei-Ngan Chin

This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.

View →
cs.PLcs.LOTheoreticalRecentJul 20, 2026

The Because-Calculus: Separating Production, Existence, and Interpretation in Computation

Oscar Perez Mora

This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.

View →
cs.PLTheoreticalRecentAug 11, 2026

A Rig of Transformations

Emma Tye

The paper presents a model of finite algebraic data types as a commutative rig to describe data layouts and their transformations in high-level functional languages.

View →
cs.AIcs.DBTheoreticalRecentJun 23, 2026

Abstractions of Queries in Ontology-Based Data Access

Michel Leclère, Marie-Laure Mugnier, Guillaume Pérution-Kihli

This paper studies query abstraction in ontology-based data access using existential rules and certain answer semantics.

View →