Sciweavers

99 search results - page 8 / 20
» Building Compilers by Combining Algebras
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Dynamic optimization for functional reactive programming using generalized algebraic data types
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
Henrik Nilsson
WADT
1998
Springer
13 years 11 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
LICS
1994
IEEE
13 years 11 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
PLDI
2011
ACM
12 years 10 months ago
Language-independent sandboxing of just-in-time compilation and self-modifying code
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
Jason Ansel, Petr Marchenko, Úlfar Erlingss...
TAPSOFT
1997
Springer
13 years 11 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May