Sciweavers

216 search results - page 24 / 44
» Testing Extensible Language Debuggers
Sort
View
AMAST
2006
Springer
14 years 1 months ago
Formal Islands
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
Emilie Balland, Claude Kirchner, Pierre-Etienne Mo...
VL
2008
IEEE
121views Visual Languages» more  VL 2008»
14 years 4 months ago
Can feature design reduce the gender gap in end-user software development environments?
Recent research has begun to report that female enduser programmers are often more reluctant than males to employ features that are useful for testing and debugging. These earlier...
Valentina Grigoreanu, Jill Cao, Todd Kulesza, Chri...
SPE
2008
108views more  SPE 2008»
13 years 9 months ago
Effective asymmetric XML compression
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
Przemyslaw Skibinski, Szymon Grabowski, Jakub Swac...
IANDC
2011
129views more  IANDC 2011»
13 years 4 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
POPL
2010
ACM
14 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts