Sciweavers

2335 search results - page 191 / 467
» Type Checking Type Classes
Sort
View
JLP
2011
160views more  JLP 2011»
13 years 5 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
COMPSAC
2003
IEEE
14 years 3 months ago
Data-Flow-Based Unit Testing of Aspect-Oriented Programs
The current research so far in aspect-oriented software development is focused on problem analysis, software design, and implementation techniques. Even though the importance of s...
Jianjun Zhao
COLT
2001
Springer
14 years 2 months ago
Robust Learning - Rich and Poor
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes ...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...
JCT
2010
117views more  JCT 2010»
13 years 8 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
POPL
1994
ACM
14 years 2 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen