61 search results - page 12 / 13 » Using Elimination Theory to construct Rigid Matrices |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
JCT
2000
13 years 7 months ago
2000
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
TLDI
2003
ACM
14 years 21 days ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...