DeepAI AI Chat
Log In Sign Up

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction

by   Tatsuya Abe, et al.

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive operators. That is, the duality of functions is not derived in the calculus but adopted as a principle of the calculus. In this paper, we propose a simple symmetric lambda-calculus corresponding to the negation-free natural deduction based bilateralism in proof-theoretic semantics. In our calculus, continuation types are represented as not negations of formulae but formulae with negative polarity. Function types are represented as the implication and but-not connectives in intuitionistic and paraconsistent logics, respectively. Our calculus is not only simple but also powerful as it includes a call-value calculus corresponding to the call-by-value dual calculus invented by Wadler. We show that mutual transformations between expressions and continuations are definable in our calculus to justify the duality of functions. We also show that every typable function has dual types. Thus, the duality of function is derived from bilateralism.


page 1

page 2

page 3

page 4


Choice-free Topological Duality for Implicative Lattices and Heyting Algebras

We develop a common semantic framework for the interpretation both of 𝐈𝐏...

Recursion does not always help

We show that, under mild assumptions, adding recursion does not increase...

Classical (Co)Recursion: Mechanics

Primitive recursion is a mature, well-understood topic in the theory and...

Cirquent calculus in a nutshell

This paper is a brief and informal presentation of cirquent calculus, a ...

Uniqueness of logical connectives in a bilateralist setting

In this paper I will show the problems that are encountered when dealing...

The Functional Machine Calculus II: Semantics

The Functional Machine Calculus (FMC), recently introduced by the author...

Scoped Capabilities for Polymorphic Effects

Type systems usually characterize the shape of values but not their free...