4438 search results - page 482 / 888 » The Case for Collaborative Programming |
167
click to vote
ESOP
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
175
click to vote
FLOPS
2004
Springer
16 years 6 days ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
177
click to vote
FMCAD
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
222
click to vote
FOSSACS
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
186
click to vote
TYPES
2004
Springer
16 years 5 days ago
2004
Springer
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...