Sciweavers

7 search results - page 1 / 2
» Reducing Right-Hand Sides for Termination
Sort
View
BIRTHDAY
2005
Springer
13 years 10 months ago
Reducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
Hans Zantema
ENTCS
2007
111views more  ENTCS 2007»
13 years 4 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
ENGL
2008
142views more  ENGL 2008»
13 years 4 months ago
A Solid-State Neuron for Spiking Neural Network Implementation
This paper presents a compact analog neuron cell incorporating an array of charge-coupled synapses connected via a common output terminal. The novel silicon synapse is based on a t...
Yajie Chen, Steve Hall, Liam McDaid, Octavian Buiu...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 2 months ago
Adaptive Compress-and-Forward Relaying in Fading Environments with or without Wyner-Ziv Coding
Abstract--Compress-and-Forward is a protocol for transmission over relay networks in which the relay forwards a compressed version of the signal it observes. The compression method...
Harold H. Sneessens, Luc Vandendorpe, J. Nicholas ...
TCS
2008
13 years 4 months ago
Loop detection in term rewriting using the eliminating unfoldings
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
Étienne Payet