Sciweavers

1368 search results - page 38 / 274
» Recursive modules for programming
Sort
View
POPL
2003
ACM
14 years 8 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
IH
2005
Springer
14 years 1 months ago
Dither Modulation Watermarking of Dynamic Memory Traces
We describe a dynamic software watermark embedded in the memory trace of an executing Java program. Our approach is a generalisation of the spread–transform watermarking techniqu...
Alan J. Larkin, Félix Balado, Neil J. Hurle...
IFIP
2004
Springer
14 years 1 months ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
ECOOP
2005
Springer
14 years 1 months ago
Open Modules: Modular Reasoning About Advice
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program. Advice can help to make programs m...
Jonathan Aldrich
APLAS
2007
ACM
13 years 12 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel