23201 search results - page 100 / 4641 » Rewriting Systems with Data |
280
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
158
click to vote
TLCA
2007
Springer
15 years 11 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
132
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
149
click to vote
SC
1991
ACM
15 years 9 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
127
click to vote
OSDI
2006
ACM
16 years 5 months ago
2006
ACM
Vulnerability-driven filtering of network data can offer a fast and easy-to-deploy alternative or intermediary to software patching, as exemplified in Shield [43]. In this paper, ...