Sciweavers

852 search results - page 120 / 171
» entcs 2010
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
15 years 7 days ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
133
Voted
ENTCS
2002
121views more  ENTCS 2002»
15 years 7 days ago
Regular Expression Types for Strings in a Text Processing Language
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa
147
Voted
ENTCS
2002
136views more  ENTCS 2002»
15 years 4 days ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
89
Voted
ENTCS
1998
90views more  ENTCS 1998»
15 years 3 days ago
Handling ELAN rewrite programs via an exchange format
Designing a programming environment raises difficult implementation problems since such software is not just one piece of code able to execute programs expressed in a given progra...
Peter Borovanský, Salma Jamoussi, Pierre-Et...
99
Voted
ENTCS
2006
158views more  ENTCS 2006»
15 years 14 days ago
Connector Colouring I: Synchronisation and Context Dependency
Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and conte...
Dave Clarke, David Costa, Farhad Arbab