pith. sign in

arxiv: 2606.20944 · v1 · pith:PRRH652Knew · submitted 2026-06-18 · 💻 cs.PL

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

classification 💻 cs.PL
keywords hornderivationssmall-stepbig-stepclausessemanticsclauseprogramming
0
0 comments X
read the original abstract

The concepts of big-step and small-step derivations are familiar from the operational semantics of programming languages. These concepts are applicable in the more general setting of Horn clause derivations. We prove equivalence between big-step derivations and two versions of small-step derivations for Horn clauses. By specialising interpreters for these derivation strategies, any set of Horn clauses can be transformed into a provably equivalent set of clauses that inherits the behaviour of a given (big- or small-step) Horn clause interpreter. As a special case of this transformation, big-step semantics for any programming language, expressed directly as Horn clauses, can be transformed into equivalent small-step semantics. Experiments with a variety of programming languages are reported.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.