Results 61 to 70 of about 11,543 (183)
Modular Denotational Semantics for Effects with Guarded Interaction Trees [PDF]
, 2023 Dan Frumin, Amin Timany, Lars Birkedal
openalex +1 more source
Winged horses, rascals and discourse referents
Theoria, EarlyView.Abstract This paper discusses some remarks Kaplan made in ‘Bob and Carol and Ted and Alice’ concerning empty names. I show how his objections to a particular view involving descriptions derived from Ramsification can be avoided by a nearby alternative framed in terms of discourse reference.
Andreas Stokke
wiley +1 more source
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus.
Giulio Guerrieri
doaj +1 more source
An Adequate While-Language for Hybrid Computation
, 2019 Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology.
Goncharov, Sergey, Neves, Renato
core +1 more source
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, EarlyView.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
A Metalanguage for Guarded Iteration
, 2018 Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying ...
A Carboni +27 more
core +1 more source
Recurrence extraction and denotational semantics with recursive definitions [PDF]
, 2022 Norman Danner
openalex +1 more source
Where Mathematical Symbols Come From
Topics in Cognitive Science, EarlyView.Abstract There is a sense in which the symbols used in mathematical expressions and formulas are arbitrary. After all, arithmetic would be no different if we would replace the symbols ‘+$+$’ or ‘8’ by different symbols. Nevertheless, the shape of many mathematical symbols is in fact well motivated in practice.
Dirk Schlimm
wiley +1 more source
Abstract Hidden Markov Models: a monadic account of quantitative information flow [PDF]
Logical Methods in Computer Science, 2019 Hidden Markov Models, HMM's, are mathematical models of Markov processes with state that is hidden, but from which information can leak. They are typically represented as 3-way joint-probability distributions.
Annabelle McIver +2 more
doaj +1 more source
Meta‐Metamodelling of Engineering Systems by Help of Abstract Mathematics
Mathematical Methods in the Applied Sciences, Volume 48, Issue 16, Page 14815-14827, 15 November 2025.ABSTRACT The growing trend of automation in engineering significantly increases the complexity of engineering systems and necessitates a deeper understanding of the coupling of physical and cyber components interacting within the systems. A typical example of such a highly coupled system is an autonomous construction site, where robotic systems aim to ...
Daniel Luckey, Dmitrii Legatiuk
wiley +1 more source