Wird geladen...
Strong Typed Böhm Theorem and Functional Completeness on the Linear Lambda Calculus
In this paper, we prove a version of the typed Böhm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a term t such that t s1 is convertible to u1 and t s2 is converti...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artigo |
Sprache: | Inglês |
Veröffentlicht: |
Open Publishing Association
2016-04-01
|
Schriftenreihe: | Electronic Proceedings in Theoretical Computer Science |
Online Zugang: | http://arxiv.org/pdf/1505.01326v2 |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|