5499 search results - page 259 / 1100 » Generalized Rewrite Theories |
257
click to vote
ERSHOV
2009
Springer
15 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
179
click to vote
DYNAMO
2000
15 years 8 months ago
2000
Many binary tools, such as disassemblers, dynamiccode generation systems, and executable code rewriters, need to understand how machine instructions are encoded. Unfortunately, sp...
222
click to vote
ENTCS
2007
15 years 7 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
202
click to vote
CVPR
2000
IEEE
16 years 9 months ago
2000
IEEE
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
306
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...