Sciweavers

1185 search results - page 120 / 237
» Implementing Functional Languages: a tutorial
Sort
View
CC
2006
Springer
118views System Software» more  CC 2006»
15 years 1 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa
POPL
2008
ACM
15 years 10 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
POPL
2009
ACM
15 years 10 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
ICFP
2001
ACM
15 years 9 months ago
Developing a Stage Lighting System from Scratch
Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvem...
Michael Sperber
ICFP
2010
ACM
14 years 11 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones