284 search results - page 52 / 57 » On Reversible Combinatory Logic |
BIRTHDAY
2005
Springer
15 years 3 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...
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents the principles of a new approach aimed at automatically discovering motivic patterns in monodies. It is shown that, for the results to agree with the listener...
90
Voted
PPDP
2004
Springer
15 years 3 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
124
click to vote
EEF
2000
15 years 1 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...