Laddar...
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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Open Publishing Association
2016-04-01
|
| Serie: | Electronic Proceedings in Theoretical Computer Science |
| Länkar: | http://arxiv.org/pdf/1505.01326v2 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|