Displaying 1321 – 1340 of 5985

Showing per page

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We show that the standard normalization-by-evaluation construction for the simply-typed λ β η -calculus has a natural counterpart for the untyped λ β -calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2010)

RAIRO - Theoretical Informatics and Applications

We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus has a natural counterpart for the untyped λβ-calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal...

Dense orderings, partitions and weak forms of choice

Carlos González (1995)

Fundamenta Mathematicae

We investigate the relative consistency and independence of statements which imply the existence of various kinds of dense orders, including dense linear orders. We study as well the relationship between these statements and others involving partition properties. Since we work in ZF (i.e. without the Axiom of Choice), we also analyze the role that some weaker forms of AC play in this context

Dense pairs of o-minimal structures

Lou van den Dries (1998)

Fundamenta Mathematicae

The structure of definable sets and maps in dense elementary pairs of o-minimal expansions of ordered abelian groups is described. It turns out that a certain notion of "small definable set" plays a special role in this description.

Densité et dimension

Patrick Assouad (1983)

Annales de l'institut Fourier

Une partie 𝒮 de 2 X est appelée une classe de Vapnik-Cervonenkis si la croissance de la fonction Δ 𝒮 : r Sup { | A | | A X , | A | = r } est polynomiale; ces classes se trouvent être utiles en Statistique et en Calcul des Probabilités (voir par exemple Vapnik, Cervonenkis [V.N. Vapnik, A.YA. Cervonenkis, Theor. Prob. Appl., 16 (1971), 264-280], Dudley [R.M. Dudley, Ann. of Prob., 6 (1978), 899-929]).Le présent travail est un essai de synthèse sur les classes de Vapnik-Cervonenkis. Mais il contient aussi beaucoup de résultats nouveaux,...

Descriptions of state spaces of orthomodular lattices (the hypergraph approach)

Mirko Navara (1992)

Mathematica Bohemica

Using the general hypergraph technique developed in [7], we first give a much simpler proof of Shultz's theorem [10]: Each compact convex set is affinely homeomorphic to the state space of an orthomodular lattice. We also present partial solutions to open questions formulated in [10] - we show that not every compact convex set has to be a state space of a unital orthomodular lattice and that for unital orthomodular lattices the state space characterization can be obtained in the context of unital...

Descriptive set-theoretical properties of an abstract density operator

Szymon Gła̧b (2009)

Open Mathematics

Let 𝒦 (ℝ) stand for the hyperspace of all nonempty compact sets on the real line and let d ±(x;E) denote the (right- or left-hand) Lebesgue density of a measurable set E ⊂ ℝ at a point x∈ ℝ. In [3] it was proved that { K 𝒦 ( ) : x K ( d + ( x , K ) = 1 o r d - ( x , K ) = 1 ) } is ⊓11-complete. In this paper we define an abstract density operator ⅅ± and we generalize the above result. Some applications are included.

Currently displaying 1321 – 1340 of 5985