300 search results - page 4 / 60 » Subset Types and Partial Functions |
AML
1998
13 years 7 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
FP
1991
13 years 10 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
FUIN
2010
13 years 4 months ago
2010
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...