Sciweavers

1763 search results - page 254 / 353
» A Formalization of Polytime Functions
Sort
View
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
15 years 3 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym
ECOOP
2005
Springer
15 years 3 months ago
Open Modules: Modular Reasoning About Advice
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program. Advice can help to make programs m...
Jonathan Aldrich
PPDP
2005
Springer
15 years 3 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 3 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
PLDI
2010
ACM
15 years 3 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...