3738 search results - page 331 / 748 » Parametrized Logic Programming |
162
click to vote
IWFM
2003
15 years 8 months ago
2003
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
185
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
167
click to vote
RE
2004
Springer
16 years 17 hour ago
2004
Springer
Aspect-oriented software development (AOSD) techniques support systematic modularization and composition of crosscutting concerns. Though AOSD techniques have been proposed to han...
200
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
243
click to vote
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...