Sciweavers

300 search results - page 6 / 60
» Subset Types and Partial Functions
Sort
View
DCC
2010
IEEE
13 years 7 months ago
Geometric and design-theoretic aspects of semibent functions I
The two parts of this paper consider combinatorial and geometric aspects of semibent functions. In the first part of this note we obtain 2
Ulrich Dempwolff, Timo Neumann
PEPM
1994
ACM
13 years 11 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
TPHOL
2003
IEEE
14 years 18 days ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
LOPSTR
1992
Springer
13 years 11 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf
ICFP
2005
ACM
14 years 7 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy