Sciweavers

1096 search results - page 76 / 220
» Abstract Canonical Inference
Sort
View
AISC
1992
Springer
15 years 1 months ago
A Type-Coercion Problem in Computer Algebra
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
Andreas Weber
AH
2004
Springer
15 years 1 months ago
Adaptive Help for Webbased Applications
Abstract. This paper presents an approach that uses the techniques of plan recognition not only to infer short-term plans and goals, but also to infer the long-term procedural know...
Dorothea Iglezakis
RELMICS
2000
Springer
15 years 1 months ago
Implication-with-possible-exceptions
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
Nerman Jurrjus, Harrie C. M. de Swart
ICFP
2002
ACM
15 years 9 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
ECOOP
2003
Springer
15 years 3 months ago
A Calculus of Untyped Aspect-Oriented Programs
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
Radha Jagadeesan, Alan Jeffrey, James Riely