71 search results - page 7 / 15 » Unions and the axiom of choice |
LFP
1990
13 years 8 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
ER
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
ACL
1994
13 years 9 months ago
1994
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for re...
MSCS
2006
13 years 7 months ago
2006
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...