Intersection types for unbind and rebind
We define a type system with intersection types for an extension of lambda-calculus with unbind and rebind operators. In this calculus, a term with free variables, representing open code, can be packed into an "unbound" term, and passed around as a value. In order to execute inside code, an unbound...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Open Publishing Association
2011-01-01
|
| Col·lecció: | Electronic Proceedings in Theoretical Computer Science |
| Accés en línia: | http://arxiv.org/pdf/1101.4426v1 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|