Related papers: A Weakly Initial Algebra for Higher-Order Abstract…
High-level synthesis (HLS) is a powerful tool for developing efficient hardware accelerators that rely on specialized memory systems to achieve sufficient on-chip data reuse and off-chip bandwidth utilization. However, even with HLS,…
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking…
In this paper we study the representation of partial differential equations (PDEs) as abstract differential-algebraic equations (DAEs) with dissipative Hamiltonian structure (adHDAEs). We show that these systems not only arise when there…
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…
This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
We continue our study of operator algebras with contractive approximate identities (cais) by presenting a couple of interesting examples of operator algebras with cais, which in particular answer questions raised in previous papers in this…
The Higher-Order $\Psi$-calculus framework (HO$\Psi$) is a generalisation of many first- and higher-order extensions of the $\pi$-calculus. It was proposed by Parrow et al. who showed that higher-order calculi such as HO$\pi$ and CHOCS can…
Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to…
We introduce a method of rigorous analysis of the location and type of complex singularities for nonlinear higher order PDEs as a function of the initial data. The method is applied to determine rigorously the asymptotic structure of…
Guided by Tarksi's fixpoint theorem in order theory, we show how to derive monotone recursive types with constant-time roll and unroll operations within Cedille, an impredicative, constructive, and logically consistent pure typed lambda…
Existing Weakly-Supervised Referring Expression Comprehension (WREC) methods, while effective, are fundamentally limited by a one-to-one mapping assumption, hindering their ability to handle expressions corresponding to zero or multiple…
We compute explicitly the primitive ideal space of the Bost-Connes Hecke C*-algebra by embedding it as a full corner in a transformation group C*-algebra and applying a general theorem of Williams. This requires the computation of the…
Church's simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated…
While dense retrieval has been shown effective and efficient across tasks and languages, it remains difficult to create effective fully zero-shot dense retrieval systems when no relevance label is available. In this paper, we recognize the…
The main goal of this thesis is to develop the integration theory of curved homotopy Lie algebras. In the first chapter, we develop the operadic calculus needed: we encode non-necessarily conilpotent coalgebras with operads and introduce…
By omitting the unitary constraint from the definition of weak post-Hopf algebras, we introduce the concept of relaxed weak post-Hopf algebras, offering a thorough characterization of all feasible relaxed weak post-Hopf algebraic structures…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…
In this work we use Hodge theoretic methods to study homotopy types of complex projective manifolds with arbitrary fundamental groups. The main tool we use is the \textit{schematization functor} $X \mapsto (X\otimes \mathbb{C})^{sch}$,…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…