Sciweavers

3736 search results - page 285 / 748
» Generative Programming
Sort
View
POPL
2003
ACM
16 years 4 months ago
A type system for higher-order modules
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
Derek Dreyer, Karl Crary, Robert Harper
119
Voted
PADL
2010
Springer
16 years 21 days ago
ActionScript In-Lined Reference Monitoring in Prolog
Abstract. A Prolog implementation of an In-lined Reference Monitoring system prototype for Adobe ActionScript Bytecode programs is presented. Prolog provides an elegant framework f...
Meera Sridhar, Kevin W. Hamlen
VLDB
1990
ACM
86views Database» more  VLDB 1990»
15 years 7 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
PLILP
1994
Springer
15 years 7 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
JAR
2010
108views more  JAR 2010»
15 years 2 months ago
Procedural Representation of CIC Proof Terms
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
Ferruccio Guidi