Results 111 to 120 of about 9,900 (232)

Conservative Extensions of Polymorphic PCF [PDF]

open access: yes, 1996
We prove that product and sum types are definable in polymorphic PCF with call-by-name evaluation strategy. This establishes polymorphic PCF and its extensions can be conservatively extended by product and sum types and recursive types. 1.
Yohji Akama
core  

Confocal-pCF analysis of NLS-GFP in cells. [PDF]

open access: yes, 2014
(A,B) Confocal-pCF(4) carpets obtained along the N→C (A) and C→N (B) directions along a line crossing the N/C interface. The two carpets are the confocal-pCF analogs of the STED-pCF carpets reported as Figure 3C,D in main text.
Paolo Bianchini (472316)   +4 more
core   +1 more source

The recursion hierarchy for PCF is strict [PDF]

open access: yesLogical Methods in Computer Science, 2018
We consider the sublanguages of Plotkin's PCF obtained by imposing some bound k on the levels of types for which fixed point operators are admitted. We show that these languages form a strict hierarchy, in the sense that a fixed point operator for a type of level k can never be defined (up to observational equivalence) using fixed point operators for ...
openaire   +3 more sources

Local Eviction Moratoria and the Spread of COVID‐19

open access: yesSouthern Economic Journal, EarlyView.
ABSTRACT At different stages during the initial onset of the COVID‐19 pandemic, various US states and local municipalities enacted eviction moratoria. One of the main aims of these moratoria was to slow the spread of COVID‐19 infections. We deploy a semiparametric difference‐in‐differences approach with an event study specification to examine whether ...
Julia Hatamyar, Christopher F. Parmeter
wiley   +1 more source

Message du PCF [PDF]

open access: yes, 1998
Message du PCF. In: Recherches Internationales, n°52-53, 1998.

core  

PCF : un drôle de féminisme... [PDF]

open access: yes, 1987
Desbois Josette. PCF : un drôle de féminisme.... In: Cahiers du féminisme, n°40, 1987. Dossier : Au plaisir des femmes (été 1987) pp.
Trat, Josette
core   +1 more source

Dy2 Schiff Base Single Molecule Magnet Forming a Halogen Bonding Network: Experiment and Theory

open access: yesZeitschrift für anorganische und allgemeine Chemie, EarlyView.
A major challenge to improve SMMs is control over phonon‐based relaxation mechanisms, such as the Raman process. We approach this challenge through the incorporation of intermolecular interactions, which can restrict acoustic phonon modes. For this, we engineer the crystal lattice of a Dy2 SMM using halogen bonding and investigate its properties using ...
Jonas Braun   +7 more
wiley   +1 more source

On PCF Polynomials [PDF]

open access: yes
The author of [27] proves that the set of post-critically finite (PCF) polynomials of given degree is a set of bounded height, up to PGL_2-conjugacy. This result is extended to show that the set of monic polynomials g(z) with rational coefficients of ...
Fraser, Benjamin Alexander
core  

Association of Preoperative Cognitive Impairment with Poor Outcomes following Transforaminal Lumbar Spinal Fusion Surgery

open access: yesFormosan Journal of Musculoskeletal Disorders
Background: Preoperative cognitive function (PCF) is gaining attention as a predictor of surgical outcomes due to its association with muscle function and recovery. Its role in postoperative recovery following transforaminal lumbar interbody fusion (TLIF)
Duy Nguyen Anh Tran   +5 more
doaj   +1 more source

Kripke Logical Relations and PCF

open access: yesInformation and Computation, 1995
\textit{A. Jung} and \textit{J. Tiuryn} [Lect. Notes Comput. Sci. 664, 245-257 (1993; Zbl 0795.03021)] introduced ``Kripke logical relations'' to characterize \(\lambda\)-definability. Here, these relations are used to show that \textit{K. Sieber's} model of PCF [``New steps toward full abstraction for local variables'', in: ACM SIGLPLAN Workshop on ...
O'Hearn, Peter W., Riecke, John G.
openaire   +2 more sources

Home - About - Disclaimer - Privacy