Sciweavers

8232 search results - page 462 / 1647
» Dynamic Logic Programming
Sort
View
FAC
2000
94views more  FAC 2000»
15 years 6 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
ENTCS
2002
97views more  ENTCS 2002»
15 years 6 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
IJCAI
1989
15 years 8 months ago
Explanation Based Program Transformation
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
ASPDAC
2004
ACM
80views Hardware» more  ASPDAC 2004»
16 years 10 days ago
Exploiting program execution phases to trade power and performance for media workload
Abstract- Processing streaming media comprisesseveral program phases (often distinct) that are periodic and independent of application data. In this paper we characterize execution...
Subhasis Banerjee, G. Surendra, S. K. Nandy
POPL
1989
ACM
15 years 11 months ago
Dynamic Typing in a Statically-Typed Language
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...
Martín Abadi, Luca Cardelli, Benjamin C. Pi...