Results 81 to 90 of about 85,558 (251)
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
In defense of value incomparability: A reply to Dorr, Nebel, and Zuehl
Noûs, EarlyView.Abstract Cian Dorr, Jacob Nebel, and Jake Zuehl have argued that no objects are incomparable in value. One set of arguments they offer depart from a principle they call ‘Strong Monotonicity’, which states that if x is good and y is not good, then x is better than y.
Erik Carlson, Olle Risberg
wiley +1 more source
A Domain Semantics for Higher-Order Recursive Processes [PDF]
arXiv, 2020 The polarized SILL programming language uniformly integrates functional programming and session-typed message-passing concurrency. It supports general recursion, asynchronous and synchronous communication, and higher-order programs that communicate channels and processes.
arxiv
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
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
Modular Composition of Language Features through Extensions of Semantic Language Models [PDF]
, 1999 Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension.
Pahl, Claus
core +1 more source
Proper names as counterpart‐theoretic individual concepts
Philosophy and Phenomenological Research, EarlyView.Abstract Many philosophers and linguists have been attracted to counterpart theory as a framework for natural language semantics. I raise a novel problem for counterpart theory involving simple declarative sentences with proper names. To resolve this problem, counterpart theorists must introduce the notion of a counterpart in the semantics of the non ...
James Ravi Kirkpatrick
wiley +1 more source
CCSL denotational semantics [PDF]
, 2014 The Clock Constraint Specification Language (CCSL) has been informally introduced in the specifications of the \uml Profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE). In a previous report entitled ``Syntax and Semantics of the Clock Constraint Specification Language'', we equipped a kernel of CCSL with an operational semantics.
Deantoni, Julien +2 more
openaire +3 more sources
Labelled transition systems as a Stone space [PDF]
Logical Methods in Computer Science, 2005 A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events.
Michael Huth
doaj +1 more source
Near-synonyms of Anglo-Saxon and Latinate Origin
Iperstoria, 2022 This article examines the semantic relations holding between pairs of Anglo-Saxon and Latinate near-synonyms in present-day English, such as speed/velocity, sweat/perspire, shy/timid and before/prior.
Daniele Franceschi
doaj +1 more source