2111 search results - page 160 / 423 » How to Program Pervasive Systems |
90
Voted
MSR
2006
ACM
15 years 6 months ago
2006
ACM
Revision history provides a rich source of information to improve the understanding of changes made to programs, but it yields only limited insight into how these changes occurred...
107
Voted
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
110
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
106
click to vote
STACS
1991
Springer
15 years 4 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
100
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...