On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Matsuoka, Satoshi
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911547207450624
author Matsuoka, Satoshi
author_facet Matsuoka, Satoshi
contents We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching theory. The second is an inductive style, which follows a more traditional mathematical approach. We also discuss several optimizations for these representations. Furthermore, we present a case study that demonstrates the potential applications of our approach across various domains.
format Preprint
id arxiv_https___arxiv_org_abs_2603_25337
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System
Matsuoka, Satoshi
Programming Languages
Logic in Computer Science
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching theory. The second is an inductive style, which follows a more traditional mathematical approach. We also discuss several optimizations for these representations. Furthermore, we present a case study that demonstrates the potential applications of our approach across various domains.
title On Representability of Multiple-Valued Functions by Linear Lambda Terms Typed with Second-order Polymorphic Type System
topic Programming Languages
Logic in Computer Science
url https://arxiv.org/abs/2603.25337