Sciweavers

311 search results - page 46 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
PPDP
2007
Springer
14 years 2 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
POPL
2008
ACM
14 years 9 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
POPL
2006
ACM
14 years 9 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
ICFCA
2004
Springer
14 years 2 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
PLDI
2010
ACM
14 years 1 months ago
Mint: Java multi-stage programming using weak separability
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
Edwin Westbrook, Mathias Ricken, Jun Inoue, Yilong...