Sciweavers

3516 search results - page 14 / 704
» Programming Languages: Application and Interpretation
Sort
View
ICALP
2007
Springer
16 years 22 hour ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
ERLANG
2004
ACM
15 years 11 months ago
HiPE on AMD64
Erlang is a concurrent functional language designed for developing large-scale, distributed, fault-tolerant systems. The primary implementation of the language is the Erlang/OTP s...
Daniel Luna, Mikael Pettersson, Konstantinos F. Sa...
EUROPAR
1998
Springer
15 years 10 months ago
Performance Measurement of Interpreted Programs
Abstract. In an interpreted execution there is an interdependence between the interpreter's execution and the interpreted application's execution; the implementation of t...
Tia Newhall, Barton P. Miller
DEXAW
2005
IEEE
159views Database» more  DEXAW 2005»
15 years 11 months ago
A Self-Healing Approach for Object-Oriented Applications
In this paper, we present our approach and architecture for fault diagnosis and self-healing of interpreted objectoriented applications. By combining aspect-oriented programming, ...
A. Reza Haydarlou, Benno J. Overeinder, Frances M....
ICFP
2002
ACM
16 years 5 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy