Results 81 to 90 of about 11,768 (185)
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
Polysemy and roots: Deep versus shallow fetching
Mind &Language, Volume 40, Issue 5, Page 472-491, November 2025.The paper argues for a model of polysemy based on the blueprint offered by Paul Pietroski whereby the meaning of a lexical item is an instruction to fetch a concept from an address. We show that the bare idea of fetching admits of a deep construal, where a concept is fetched, and a shallow construal, where the instruction merely links a lexical item to
John Collins, Tamara Dobler
wiley +1 more source
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs [PDF]
, 2014 We extract a novel quantum programming paradigm - superposition of programs - from the design idea of a popular class of quantum algorithms, namely quantum walk-based algorithms.
Feng, Yuan, Ying, Mingsheng, Yu, Nengkun
core
Similarity Assessment of the Engineering Concepts: Decision‐Making Support and Metrics
Systems Engineering, Volume 28, Issue 5, Page 628-639, September 2025.ABSTRACT The new product development (NPD) process is a systematic approach to bring new products and innovations to market. Nowadays, this process is affected by a number of influencing factors associated with the fast‐paced technological changes. One of those factors is the distributed design nature of product development activities: team members are
Yaroslav Menshenin +3 more
wiley +1 more source
Disentangling Parallelism and Interference in Game Semantics [PDF]
Logical Methods in Computer ScienceGame semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a ...
Simon Castellan, Pierre Clairambault
doaj +1 more source
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
, 2009 The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation.
Corrado Böhm +3 more
core +1 more source
Distributed measurement-based quantum computation
, 2005 We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as
D'Hondt, Ellie +3 more
core +1 more source
Meaning and Reference in Programming Languages
PhilosophiesThis paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages.
Nicola Angius
doaj +1 more source
Semantic Variability of the Word ‘Creature’ in Elizabethan Prose Fiction [PDF]
Acta Universitatis Sapientiae: PhilologicaThe present research focuses on the exploration of the meaning of the word ‘creature’ in the context of Elizabethan prose fiction. The inherent vagueness and ambiguity of the lexeme ‘creature’, comprising diverse meanings, yields its multiple readings
Liudmyla Hryzhak
doaj +1 more source
From standard to implementation denotational semantics [PDF]
, 1980 Martin R. Raskovsky, P.A. Collier
openalex +1 more source