Sciweavers

1882 search results - page 183 / 377
» Transformational Programming and Forests
Sort
View
DLS
2008
213views Languages» more  DLS 2008»
15 years 7 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
EUROPAR
2008
Springer
15 years 7 months ago
Transparent Mobile Middleware Integration for Java and .NET Development Environments
Developing a distributed application for mobile resource constrained devices is a difficult and error-prone task that requires awareness of several system-level details (e.g., faul...
Edgar Marques, Luís Veiga, Paulo Ferreira
ISCI
2007
135views more  ISCI 2007»
15 years 5 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
ICLP
2011
Springer
14 years 8 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ICFP
2003
ACM
16 years 5 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz