Sciweavers

2335 search results - page 102 / 467
» Type Checking Type Classes
Sort
View
CE
2006
86views more  CE 2006»
13 years 9 months ago
Virtual teamwork in very large undergraduate classes
Collaborative work is an important part of tertiary education but it is very difficult to arrange and supervise for extremely large classes of students in their first year. The po...
P. M. Alexander
MP
2006
113views more  MP 2006»
13 years 9 months ago
A class of polynomially solvable linear complementarity problems
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
Teresa H. Chu
CADE
2006
Springer
14 years 9 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
ML
2008
ACM
104views Machine Learning» more  ML 2008»
13 years 9 months ago
Many holes in hindley-milner
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types. Existing approaches require dynamic checks or more...
Sam Lindley
VLDB
2002
ACM
110views Database» more  VLDB 2002»
13 years 8 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...