Sciweavers

3056 search results - page 229 / 612
» Compiling Embedded Languages
Sort
View
POPL
1998
ACM
15 years 3 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
SAIG
2000
Springer
15 years 2 months ago
Fragmental Specialization
Traditional offline program specialization relies on staging of a computation into two levels, static and dynamic. We present a generalization thereof where the static input data o...
Simon Helsen, Peter Thiemann
CISSE
2008
Springer
15 years 29 days ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and ...
A. M. Paracha, F. Franek
JFP
2002
108views more  JFP 2002»
14 years 10 months ago
A calculus with polymorphic and polyvariant flow types
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
EMSOFT
2006
Springer
15 years 2 months ago
A timing model for synchronous language implementations in simulink
We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementat...
Timothy Bourke, Arcot Sowmya