Sciweavers

6274 search results - page 286 / 1255
» Proofs, Programs, Processes
Sort
View
APBC
2003
138views Bioinformatics» more  APBC 2003»
15 years 8 months ago
A New Approach to Protein Structure and Function Analysis Using Semi-structured Databases
The development of high-throughput genome sequencing and protein structure determination techniques have provided researchers with a wealth of biological data. Integrated analysis...
William M. Shui, Raymond K. Wong, Stephen C. Graha...
ICFP
2010
ACM
15 years 7 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
APAL
2008
104views more  APAL 2008»
15 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
DAM
2002
135views more  DAM 2002»
15 years 6 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
ENTCS
2002
136views more  ENTCS 2002»
15 years 6 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...