Sciweavers

3516 search results - page 342 / 704
» Programming Languages: Application and Interpretation
Sort
View
POPL
2008
ACM
16 years 7 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
JFP
2000
95views more  JFP 2000»
15 years 6 months ago
A modular module system
A simple implementation of an SML-like module system is presented as a module parameterized by a base language and its type-checker. This implementation is useful both as a detail...
Xavier Leroy
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
16 years 11 days ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...
KI
2004
Springer
16 years 4 days ago
SmartWeb: Mobile Applications of the Semantic Web
Abstract Recent progress in mobile broadband communication and semantic web technology is enabling innovative internet services that provide advanced personalization and localizati...
Wolfgang Wahlster
RIA
2007
123views more  RIA 2007»
15 years 6 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin