300 search results - page 8 / 60 » Subset Types and Partial Functions |
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
JSYML
2000
13 years 7 months ago
2000
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...
JAM
2010
13 years 2 months ago
2010
This paper is devoted to the identification of the unknown smooth coefficient c entering the hyperbolic equation c(x)2 t u-u = 0 in a bounded smooth domain in Rd from partial (on ...
WFLP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
TLCA
2005
Springer
14 years 24 days ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...