Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa |
Analyzing logic programs with dynamic scheduling
Cita
Marriott, K., García de la Banda, M. and Hermenegildo, Manuel V. 
ORCID: https://orcid.org/0000-0002-7583-323X
(1994).
Analyzing logic programs with dynamic scheduling.
En: "21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages", January 17-21, 1994, Portland, Oregon. ISBN 0897916360.
ORCID: https://orcid.org/0000-0002-7583-323X
(1994).
Analyzing logic programs with dynamic scheduling.
En: "21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages", January 17-21, 1994, Portland, Oregon. ISBN 0897916360.
Descripción
| Título: | Analyzing logic programs with dynamic scheduling |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages |
| Fechas del Evento: | January 17-21, 1994 |
| Lugar del Evento: | Portland, Oregon |
| Título del Libro: | POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages |
| Fecha: | 1994 |
| ISBN: | 0897916360 |
| Materias: | |
| ODS: | |
| Escuela: | Facultad de Informática (UPM) [antigua denominación] |
| Departamento: | Inteligencia Artificial |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in which some calis are dynamically "delayed" until their arguments are sufRciently instantiated to allow the cali to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.
Más información
| ID de Registro: | 14455 |
|---|---|
| Identificador DC: | https://oa.upm.es/14455/ |
| Identificador OAI: | oai:oa.upm.es:14455 |
| URL Oficial: | http://dl.acm.org/citation.cfm?id=177883 |
| Depositado por: | Biblioteca Facultad de Informatica |
| Depositado el: | 12 Feb 2013 07:52 |
| Ultima Modificación: | 27 Feb 2023 12:06 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
