Browsing 1 - Oberwolfach Preprints (OWP) by MFO Scientific Program "OWLF 2022"

Now showing items 1-7 of 7

    • Automatic Differentiation for ML-Familiy Languages: Correctness via Logical Relations 

      [OWP-2023-07] Lucatelli Nunes, Fernando; Vákár, Matthijs (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)

    • Cauchy Completeness, Lax Epimorphisms and Effective Descent for Split Fibrations 

      [OWP-2023-06] Lucatelli Nunes, Fernando; Prezado, Rui; Sousa, Lurdes (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)
      For any suitable base category V, we find that V-fully faithful lax epimorphisms in V-Cat are precisely those V-functors F:A→B ...

    • Flag-Accurate Arrangements 

      [OWP-2023-01] Mücksch, Paul; Röhrle, Gerhard; Tran, Tan Nhat (Mathematisches Forschungsinstitut Oberwolfach, 2023-02-13)
      In [MR21], the first two authors introduced the notion of an accurate arrangement, a particular notion of freeness. In this paper, we consider a special subclass, where the property of accuracy stems from a flag of flats ...

    • Hutchinson's Intervals and Entire Functions from the Laguerre-Pólya Class 

      [OWP-2022-19] Nguyen, Thu Hien; Vishnyakova, Anna (Mathematisches Forschungsinstitut Oberwolfach, 2022-12-12)
      We find the intervals [α,β(α)] such that if a univariate real polynomial or entire function f(z)=a0+a1z+a2z2+⋯ with positive coefficients satisfy the conditions $ \frac{a_{k-1}^2}{ ...

    • Lax Comma Categories of Ordered Sets 

      [OWP-2023-08] Clementino, Maria Manuel; Lucatelli Nunes, Fernando (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)
      Let Ord be the category of (pre)ordered sets. Unlike Ord/X, whose behaviour is well-known, not much can be found in the literature about the lax comma 2-category Ord//X. In this paper ...

    • Logical Relations for Partial Features and Automatic Differentiation Correctness 

      [OWP-2023-09] Lucatelli Nunes, Fernando; Vákár, Matthijs (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)
      We present a simple technique for semantic, open logical relations arguments about languages with recursive types, which, as we show, follows from a principled foundation in categorical semantics. We demonstrate how it can ...

    • Semantic Factorization and Descent 

      [OWP-2023-05] Lucatelli Nunes, Fernando (Mathematisches Forschungsinstitut Oberwolfach, 2023-06-19)
      Let A be a 2-category with suitable opcomma objects and pushouts. We give a direct proof that, provided that the codensity monad of a morphism p exists and is preserved by a suitable morphism, the factorization ...