383 search results - page 25 / 77 » Abstracting Complex Languages through Transformation and Com... |
114
click to vote
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
125
click to vote
ISNN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
121
click to vote
CC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
101
click to vote
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
DOCENG
2003
ACM
15 years 6 months ago
2003
ACM
To support the rapid growth of the web and e-commerce, W3C developed DOM as an application programming interface that the abstract, logical tree structure of an XML document. In t...