Related papers: On the characterization of models of H*: The seman…
We give a characterization, with respect to a large class of models of untyped $\lambda$-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is $\mathcal{H}^*$. An extensional K-model $D$…
We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding…
It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
We show that a field $K$ is model complete (in the language of rings) if and only if the Heisenberg group $H(K)$ is model complete (in the language of groups). To show that, we extend Levchuk's result about automorphisms of $H(K)$ to the…
Abstraction is the process of extracting the essential features from raw data while ignoring irrelevant details. It is well known that abstraction emerges with depth in neural networks, where deep layers capture abstract characteristics of…
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…
It is easy to see that every character (i.e. unital *-homomorphism to the complex numbers) of a commutative unital associative *-algebra is a pure state (i.e. extreme point in the convex set of all normalized positive linear functionals).…
The representations of a $k$-graph $C^*$-algebra $C^*(\Lambda)$ which arise from $\Lambda$-semibranching function systems are closely linked to the dynamics of the $k$-graph $\Lambda$. In this paper, we undertake a systematic analysis of…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
Associated with a smooth, $d$-closed $(1, 1)$-form $\alpha$ of possibly non-rational De Rham cohomology class on a compact complex manifold $X$ is a sequence of asymptotically holomorphic complex line bundles $L_k$ on $X$ equipped with $(0,…
The lambda-calculus is a peculiar computational model whose definition does not come with a notion of machine. Unsurprisingly, implementations of the lambda-calculus have been studied for decades. Abstract machines are implementations…
We study the strict type assignment for lambda-mu that is presented in [van Bakel'16]. We define a notion of approximants of lambda-mu-terms, show that it generates a semantics, and that for each typeable term there is an approximant that…
We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…
In this paper, we define a new 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. We also prove a completeness result of our realizability…