Results 11 to 20 of about 6,339,924 (312)
Linear Lambda-Calculus is Linear
We prove a linearity theorem for an extension of linear logic with addition and multiplication by a scalar: the proofs of some propositions in this logic are linear in the algebraic sense. This work is part of a wider research program that aims at defining a logic whose proof language is a quantum programming language.
Alejandro Díaz-Caro, Gilles Dowek
openaire +8 more sources
Hypocoercivity and hypocontractivity concepts for linear dynamical systems [PDF]
For linear dynamical systems (in continuous-time and discrete-time), we revisit and extend the concepts of hypocoercivity and hypocontractivity and give a detailed analysis of the relations of these concepts to (asymptotic) stability, as well as (semi ...
Achleitner, Franz; orcid: +2 more
core +2 more sources
Linearity and Bisimulation [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nobuko Yoshida +2 more
openaire +1 more source
A Linear Algebra Approach to Linear Metatheory [PDF]
Linear typed $λ$-calculi are more delicate than their simply typed siblings when it comes to metatheoretic results like preservation of typing under renaming and substitution. Tracking the usage of variables in contexts places more constraints on how variables may be renamed or substituted.
Wood, James, Atkey, Robert
openaire +5 more sources
In 2017, Bauer, Johnson, Osborne, Riehl, and Tebbe (BJORT) showed that the Abelian functor calculus provides an example of a Cartesian differential category. The definition of a Cartesian differential category is based on a differential combinator which directly formalizes the total derivative from multivariable calculus. However, in the aforementioned
J. Robin B. Cockett +1 more
openaire +3 more sources
Linear Problems and Linear Algorithms
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Curtis Eaves, Uriel G. Rothblum
openaire +1 more source
Linear Invariants for Linear Systems
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict) inequalities -- equivalently, an intersection of $k$ (closed) half spaces -- as an invariant.
openaire +3 more sources
Corrigendum to "Determinants of Normalized Bohemian Upper Hessenberg Matrices" [Electron. J. of Linear Algebra 36 (2020) 352–366] [PDF]
An amended version of Proposition 3.6 of [Fasi and Negri Porzio, Electron. J. Linear Algebra 36:352--366, 2020] is presented. The result shows that the set of possible determinants of upper Hessenberg matrices with ones on the subdiagonal and elements in
Feng, Jishe +8 more
core +1 more source
Second moment constraints and the control problem of Markov jump linear systems [PDF]
This paper addresses the optimal solution for the regulator control problem of Markov jump linear systems subject to second moment constraints. We can characterize and obtain the solution explicitly using linear matrix inequalities techniques.
Do Val, J.B.R. +8 more
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Gardner, LANEVE, COSIMO, L. Wischik
openaire +3 more sources

