1776 search results - page 156 / 356 » Using a Logic Programming Language with Persistence and Cont... |
247
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
127
click to vote
POPL
1995
ACM
15 years 7 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
148
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
123
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
151
Voted
POPL
2011
ACM
14 years 6 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...