Related papers: On the characterization of models of H* : The oper…
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 H* (observations for head normalization). An…
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…
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…
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,…
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…
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…
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…
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…
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…
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…
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…
If a differential operator $D$ on a smooth Hermitian vector bundle $S$ over a compact manifold $M$ is symmetric, it is essentially self-adjoint and so admits the use of functional calculus. If $D$ is also elliptic, then the Hilbert space of…
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$…
Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects. Leveraging ideas from work on the…
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…
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).…
In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…