相关论文: Infinitary Intersection Types as Sequences: a New …
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…
We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs, projections and explicit type coercions. The calculus can be parametrized with different intersection type theories T, e.g. the Coppo-Dezani, the…
We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…
We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
A type assignment system for lambda-calculus enjoys the principal typing property if every typable term M has a special typing, called principal, from which all typings for M can be obtained via suitable operations. The existence of…
In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…
We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…
We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…
We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.
We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…
A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linear type system can verify that these resources are used…
We establish existence results for a class of mixed anisotropic and nonlocal $p$-Laplace equation with singular nonlinearities. We consider both constant and variable singular exponents. Our argument is based on an approximation method. To…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
We examine the system given by \hfill -\Delta u = \lambda (v+1)^p \qquad \Omega \hfill -\Delta v = \gamma (u+1)^\theta \qquad \Omega, \hfill u = v =0 \qquad \quad \partial \Omega, where $ \lambda,\gamma$ are positive parameters and where $…
In its customary formulation for one-component fluids, the Hierarchical Reference Theory yields a quasilinear partial differential equation for an auxiliary quantity f that can be solved even arbitrarily close to the critical point,…
We study a class of mean curvature equations $-\mathcal Mu=H+\lambda u^p$ where $\mathcal M$ denotes the mean curvature operator and for $p\geq 1$. We show that there exists an extremal parameter $\lambda^*$ such that this equation admits a…