815 search results - page 118 / 163 » Algebraic Recognizability of Languages |
IJFCS
2010
14 years 10 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (...
118
click to vote
PLDI
2011
ACM
14 years 2 months ago
2011
ACM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
100
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
117
click to vote
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
123
click to vote
CALCO
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...