4940 search results - page 28 / 988 » On the Complexity of Universal Programs |
76
Voted
PNPM
1989
15 years 6 months ago
1989
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
133
Voted
IWCC
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will ...
131
Voted
PLDI
2005
ACM
15 years 7 months ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
111
Voted
APLAS
2008
ACM
15 years 3 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
97
Voted
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...