Related papers: A syntactical proof of the operational equivalence…

I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…

We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional…

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $\lambda$-calculus, the process representations yield (at best) non-extensional $\lambda $-theories (i.e., $\beta$…

We complete the classification, up to isomorphism, of the spaces of compact operators on C([1, gamma], l_p) spaces, 1<p< infinity. In order to do this, we classify, up to isomorphism, the spaces of compact operators {\mathcal K}(E, F),…

We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of…

In this paper, we first define the equivariant infinitesimal $\eta$-form, then we compare it with the equivariant $\eta$-form, modulo exact forms, by a locally computable form. As a consequence, we obtain the singular behavior of the…

We propose an operationally-based deductive proof method for program equivalence. It is based on encoding the language semantics as logically constrained term rewriting systems (LCTRSs) and the two programs as terms. The main feature of our…

We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.

A formal description of a functional analysis approach to the Riemann zeta-functional equation that provides in principle an infinity of different proofs based on work by the author on the existence of dilation-invariant unitary operators…

For $0<\alpha, \lambda \leq 1$, the Lerch zeta-function is defined by $L(s;\alpha, \lambda)$$:= \sum_{n=0}^\infty e^{2\pi i\lambda n} (n+\alpha)^{-s}$, where $\sigma>1$. In this paper, we prove joint universality for Lerch zeta-functions…

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

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…

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…

We give a new proof of the well-known fact that all functions $(\mathbb{N} \to \mathbb{N}) \to \mathbb{N}$ which are definable in G\"odel's System T are continuous via a syntactic approach. Differing from the usual syntactic method, we…

This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics…

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…

We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.

We define an associated Lindel\"of-function for the ratio of the zeta functions and use its representation to get a unique extension of Lindel\"of's function that proves Lindel\"of's hypothesis.