Sciweavers

959 search results - page 167 / 192
» Fundamental Concepts in Programming Languages
Sort
View
CC
2006
Springer
118views System Software» more  CC 2006»
14 years 6 days 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
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 8 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
SAC
2008
ACM
13 years 8 months ago
UML-based design test generation
In this paper we investigate and propose a fully automated technique to perform conformance checking of Java implementations against UML class diagrams. In our approach, we reused...
Waldemar Pires, João Brunet, Franklin Ramal...
CF
2004
ACM
14 years 1 months ago
BLOB computing
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
Frédéric Gruau, Yves Lhuillier, Phil...
SIGCSE
2004
ACM
111views Education» more  SIGCSE 2004»
14 years 1 months ago
Events not equal to GUIs
The event driven paradigm is ubiquitous in modern software. Many texts introduce events when discussing graphical user interfaces, but the event paradigm extends well beyond that ...
Stuart A. Hansen, Timothy V. Fossum