1320 search results - page 175 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
128
Voted
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
129
Voted
FCCM
2007
IEEE
15 years 9 months ago
2007
IEEE
Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programmi...
131
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
111
click to vote
ECOOP
2004
Springer
15 years 8 months ago
2004
Springer
Today’s mainstream object-oriented compilers and tools do not support declaring and statically checking simple pre- and postconditions on methods and invariants on object represe...
217
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...