A Multiple-Conclusion Meta-Logic
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
A Multiple-Conclusion Meta-Logic
|
| Id. |
41581900 |
| Idioma |
inglés
|
| Titulo |
A Multiple-Conclusion Meta-Logic |
| Autor(es) |
A Multiple-conclusion Meta-logic,Dale Miller
|
| Localización |
http://citeseer.ist.psu.edu/146963.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
The theory of cut-free sequent proofs has been used
to motivate and justify the design of a number of
logic programming languages. Two such languages,
Prolog and its linear logic refinement, Lolli [12], provide
for various forms of abstraction (modules, abstract
data types, higher-order programming) but lack
primitives for concurrency. The logic programming
language, LO (Linear Objects) [2] provides for concurrency
but lacks abstraction mechanisms. In this
paper we present Forum, a logic programming presentation
of all of linear logic that modularly extends
the languages Prolog, Lolli, and LO. Forum, therefore,
allows specifications to incorporate both abstractions
and concurrency. As a meta-language, Forum
greatly extends the expressiveness of these other logic
programming languages. To illustrate its expressive
strength, we specify in Forum a sequent calculus proof
system and the operational semantics of a functional
programming language that incorporates such nonfunctional
features...
|
| Tipo |
ps
|
| Palabras clave |
A Multiple-conclusion Meta-logic,Dale Miller A Multiple-Conclusion Meta-Logic
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] ftp://ftp.cis.upenn.edu/pub/ircs/tr/94-30.ps.Z
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
