Sciweavers

424 search results - page 18 / 85
» types 1999
Sort
View
ICFP
1999
ACM
15 years 2 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
ICAIL
1999
ACM
15 years 2 months ago
Knowledge criteria for the evaluation of legal beliefs
In this paper, we describe an evaluation framework for legal information systems. The framework is based on knowledge criteria. We distinguish four belief types, viz. perceptual b...
Laurens Mommers, H. Jaap van den Herik
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
15 years 2 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
AIR
1999
90views more  AIR 1999»
14 years 9 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf
CL
1999
Springer
14 years 9 months ago
Optimizing floating point operations in Scheme
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
W. F. Wong