1776 search results - page 150 / 356 » Using a Logic Programming Language with Persistence and Cont... |
126
click to vote
REFLECTION
2001
Springer
15 years 7 months ago
2001
Springer
This article investigates the security problems raised by the use of proxy-based runtime meta-object protocols (MOPs) for Java and provides an approach for making meta-level code t...
251
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
133
click to vote
ICSE
2011
IEEE-ACM
14 years 6 months ago
2011
IEEE-ACM
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
121
click to vote
FPCA
1989
15 years 7 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
120
click to vote
IFL
2005
Springer
15 years 8 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...