Results 81 to 90 of about 230,472 (297)
Call-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus [PDF]
We examine the relationship between the algebraic lambda-calculus, a fragment of the differential lambda-calculus and the linear-algebraic lambda-calculus, a candidate lambda-calculus for quantum computation.
Ali Assaf +4 more
doaj +1 more source
A contextual semantics for concurrent Haskell with futures [PDF]
In this paper we analyze the semantics of a higher-order functional language with concurrent threads, monadic IO and synchronizing variables as in Concurrent Haskell. To assure declarativeness of concurrent programming we extend the language by implicit,
Sabel, David +3 more
core +1 more source
ABSTRACT Objective Autoimmune glial fibrillary acidic protein astrocytopathy (GFAP‐A) is an inflammatory central nervous system disorder with variable outcomes. Relapse occurs in a subset of patients, but early predictors remain unclear. We aimed to identify admission‐available features associated with 1‐year recurrence and develop an interpretable ...
Qingting Hong +10 more
wiley +1 more source
Semantics of Typed Lambda-Calculus with Constructors [PDF]
We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic constructors.
Barbara Petit
doaj +1 more source
Objective This research article aims to describe the prevalence, associations, and health‐related quality of life (HRQoL) impact of mucocutaneous features of systemic lupus erythematosus (SLE). Methods Data from the Asia‐Pacific Lupus Collaboration cohort were analyzed (2013–2021).
Amanda M. Saracino +42 more
wiley +1 more source
Reasonable Space for the ${\lambda}$-Calculus, Logarithmically [PDF]
Can the $\lambda$-calculus be considered a reasonable computational model? Can we use it for measuring the time $\textit{and}$ space consumption of algorithms?
Beniamino Accattoli +2 more
doaj +1 more source
Translating HOL to Dedukti [PDF]
Dedukti is a logical framework based on the lambda-Pi-calculus modulo rewriting, which extends the lambda-Pi-calculus with rewrite rules. In this paper, we show how to translate the proofs of a family of HOL proof assistants to Dedukti.
Ali Assaf, Guillaume Burel
doaj +1 more source
Contextual equivalence in lambda-calculi extended with letrec and with a parametric polymorphic type system [PDF]
This paper describes a method to treat contextual equivalence in polymorphically typed lambda-calculi, and also how to transfer equivalences from the untyped versions of lambda-calculi to their typed variant, where our specific calculus has letrec ...
Sabel, David +2 more
core
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
Three ways of introducing models of the \(\lambda\)-calculus and the weaker concept of a \(\lambda\)-algebra have recently been used by various authors. These are environmental models (structures \(M=(| M|,.)\) with maps \([[.]]_{\rho}\): \(\lambda\)-terms (with constants from M) \(\to | M|\), satisfying some natural conditions), first order models ...
openaire +1 more source

