2 CLL: A Traditional Sequent Calculus for Linear Logic 1
|
Descargar SCORM
¡Sea el primero en solicitar este recurso!
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
2 CLL: A Traditional Sequent Calculus for Linear Logic 1
|
| Id. |
47180613 |
| Idioma |
inglés
|
| Titulo |
2 CLL: A Traditional Sequent Calculus for Linear Logic 1 |
| Autor(es) |
Frank Pfenning
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.3767
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. The computational content of this proof is a non-deterministic algorithm for cut elimination which is amenable to an elegant implementation in Elf. We show this implementation in detail.
|
| Tipo |
application/pdf
|
| Palabras clave |
Linear Logic
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Formatos |
application/pdf
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.lb.cs.cmu.edu/Groups/fox/people/fp/papers/cutlin94.pdf
[References] 10.1.1.21.5854
[References] 10.1.1.50.9674
[References] 10.1.1.105.9987
[References] 10.1.1.28.2136
[References] 10.1.1.16.2984
[References] 10.1.1.25.1142
[References] 10.1.1.40.3910
[References] 10.1.1.51.3753
|
| Fecha de contribución |
26-ago-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
