20 results for “Operational semantics”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.
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.
A novel calculus is introduced that models first-class environments and function application using standard record types.
This paper defines a graph-based operational semantics and type system for Vega, a declarative language for creating interactive data visualizations.
This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.
The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.
This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.
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.
Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.
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.
The paper introduces Mental Model Management (3M), a framework for representing knowledge as compact mental models and continuously integrating new information.
NeSyCat is extended to include neural networks for learning predicates and functions, improving performance and accuracy.
This paper studies the use of logical principles to design well-behaved term syntaxes for sequent calculus in effectful computation.
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…
This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.
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.
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.
This paper studies query abstraction in ontology-based data access using existential rules and certain answer semantics.