## User login## Navigation |
## SequenceL - declarative computation on nonscalarsI recently came across the language Search(scalar Target, tuple [Subscript, Word]) = Subscript when Word = Target which applies to tuples, the programmer can apply the function directly to lists of tuples without any need to specify how that application will be performed, e.g. search(fox,[[1,dog],[2,cat],[3,fox],[4,parrot]]) â†’ 3 search(rabbit,[[1,dog],[2,cat],[3,fox],[4,parrot]]) â†’ [] The language designers (Daniel Cooke and J. Nelson Rushton) claim that this kind of thing leads to more concise and readable code, and a more direct representation of a specification. Unfortunately, the SequenceL website appears to be inaccessible at the moment. However, Daniel Cooke's site includes links to a number of papers and talks that describe SequenceL. In particular, the paper |
## Browse archives## Active forum topics |

## Recent comments

3 hours 56 min ago

4 hours 45 min ago

11 hours 19 min ago

13 hours 3 min ago

21 hours 20 min ago

21 hours 20 min ago

21 hours 56 min ago

23 hours 31 min ago

1 day 1 hour ago

1 day 4 hours ago