State-based and process-based value passing

State-based and process-based formalisms each come with their own distinct set of assumptions and properties. To combine them in a useful way it is important to be sure of these assumptions in order that the formalisms are combined in ways which have, or which allow, the intended combined properties. Consequently we cannot necessarily expect to take on state-based formalism and one process-based formalism and combine them and get something sensible, especially since the act of combining can have subtle consequences. Here we concentrate on value-passing, how it is treated in each formalism, and how the formalisms can be combined so as to preserve certain properties. Specifically, the aim is to take from the many process-based formalisms definitions that will best fit with our chosen stat-based formalism, namely Z, so that the fit is simple, has no unintended consequences and is as elegant as possible

On the Equivalence of Three-Particle Scattering Formalisms

In recent years, different on-shell $\mathbf{3}\to\mathbf{3}$ scattering formalisms have been proposed to be applied to both lattice QCD and infinite volume scattering processes. We prove that the formulation in the infinite volume presented by Hansen and Sharpe in Phys.~Rev.~D92, 114509 (2015) and subsequently Brice\~no, Hansen, and Sharpe in Phys.~Rev.~D95, 074510 (2017) can be recovered from the $B$-matrix representation, derived on the basis of $S$-matrix unitarity, presented by Mai {\em et al.} in Eur.~Phys.~J.~A53, 177 (2017) and Jackura {\em et al.} in Eur.~Phys.~J.~C79, 56 (2019). Therefore, both formalisms in the infinite volume are equivalent and the physical content is identical. Additionally, the Faddeev equations are recovered in the non-relativistic limit of both representations.Comment: 13 pages, 5 figure

Principles and Implementation of Deductive Parsing

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.Comment: 69 pages, includes full Prolog cod