相关论文: On the characterization of models of H*: The seman…
We give an exposition of the semantics of the simply-typed lambda-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for…
Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…
This paper is concerned with a class K of models and an abstract notion of submodel <=. Experience in first order model theory has shown the desirability of finding a `monster model' to serve as a universal domain for K. In the original…
Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for deterministic…
We consider an abstract pair-interaction model in quantum field theory with a coupling constant $\lambda\in {\mathbb R}$ and analyze the Hamiltonian $H(\lambda)$ of the model. In the massive case, there exist constants $\lambda_{\rm c}<0$…
We present a sequent calculus for abstract focussing, equipped with proof-terms: in the tradition of Zeilberger's work, logical connectives and their introduction rules are left as a parameter of the system, which collapses the synchronous…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
The concept of causal abstraction got recently popularised to demystify the opaque decision-making processes of machine learning models; in short, a neural network can be abstracted as a higher-level algorithm if there exists a function…
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…
A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent…
We study the theory of a Hilbert space H as a module for a unital C*-algebra A from the point of view of continuous logic. We give an explicit axiomatization for this theory and describe the structure of all the representations which are…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
Let $K$ be a $p$-adically closed field and $G$ a group interpretable in $K$. We show that if $G$ is definably semisimple (i.e. $G$ has no definable infinite normal abelian subgroups) then there exists a finite normal subgroup $H$ such that…
Many indefinite-metric (often called pseudo-Hermitian or PT-symmetric) quantum models H prove "physical" (i.e., Hermitian with respect to an innovated, ad hoc scalar product) inside a characteristic domain of parameters D. This means that…
We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…
In this paper, we discuss a method of constructing separable representations of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs $\Lambda$. We begin by giving an alternative characterization of the…
We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…