Sciweavers

584 search results - page 18 / 117
» Logic Programs as term Rewriting Systems
Sort
View
IAJIT
2010
166views more  IAJIT 2010»
14 years 8 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai
90
Voted
ENTCS
2007
103views more  ENTCS 2007»
14 years 9 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
ENTCS
2007
111views more  ENTCS 2007»
14 years 9 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...
PLILP
1998
Springer
15 years 1 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
AMAST
2008
Springer
14 years 11 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...