1989 search results - page 232 / 398 » Set functions for functional logic programming |
153
click to vote
CORR
2010
Springer
15 years 5 days ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
139
click to vote
BMCBI
2002
15 years 3 months ago
2002
Background: Functional genomics involves the parallel experimentation with large sets of proteins. This requires management of large sets of open reading frames as a prerequisite ...
102
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
239
Voted
VL
2007
IEEE
15 years 9 months ago
2007
IEEE
This articles submits the thesis that visual data modeling and programming languages are conveniently conceived as rendering, or ‘styling’, of conventional, textual languages....
138
Voted
PEPM
2004
ACM
15 years 8 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...