4 search results - page 1 / 1 » Infinitary Combinatory Reduction Systems: Normalising Reduct... |
CORR
2010
Springer
13 years 4 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...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
FLOPS
2004
Springer
13 years 10 months 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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...