215 search results - page 21 / 43 » Pattern Matching in Order-Sorted Languages |
ASPLOS
2006
ACM
15 years 3 months ago
2006
ACM
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
197
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
84
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
150
click to vote
POPL
2001
ACM
15 years 10 months ago
2001
ACM
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
103
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...