Sciweavers

632 search results - page 62 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ESOP
1998
Springer
13 years 12 months ago
Mode-Automata: About Modes and States for Reactive Systems
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
Florence Maraninchi, Yann Rémond
ICLP
2011
Springer
12 years 11 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
UM
2009
Springer
14 years 2 months ago
How Users Perceive and Appraise Personalized Recommendations
Abstract. Traditional websites have long relied on users revealing their preferences explicitly through direct manipulation interfaces. However recent recommender systems have gone...
Nicolas Jones, Pearl Pu, Li Chen
POPL
2005
ACM
14 years 8 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
POPL
2001
ACM
14 years 8 months ago
Type-preserving garbage collectors
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
Daniel C. Wang, Andrew W. Appel