Results 81 to 90 of about 246 (185)

Semantic Domains and Denotational Semantics

DAIMI Report Series, 1989
<p>Denotational Semantics is a framework for the formal description of programming language semantics. The main idea of Denotational Semantics is that each phrase of the described language is given a <em>denotation</em>: a mathematical object that represents the contribution of the phrase to the meaning of any program in which it ...
Carl A. Gunter, Peter D. Mosses, Dana S. Scott   +2 more
openaire   +2 more sources

Meaning and Reference in Programming Languages

Philosophies
This 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: Philologica
The 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

I-Semantics: Foundational Questions

Studia Semiotyczne, 2019
DOI: http://doi.org/10.26333/sts.xxxi2.05 What is the scope of a semantic theory consistent with the theoretical assumptions adopted by the generative program?
Adriano Marques da Silva
doaj  

A crisis of authority in scientific discourse. [PDF]

Cult Stud Sci Educ, 2021
Nichols MD, Petzold AM.
europepmc   +1 more source

Programming Denotational Semantics [PDF]

The Computer Journal, 1983
openaire   +1 more source

Logic + probabilistic programming + causal laws. [PDF]

R Soc Open Sci, 2023
Belle V.
europepmc   +1 more source

Denotational semantics of nets with nondeterminism [PDF]

, 1986
We define a topological framework for streams of traces. With this approach Kahn's method generalizes to nets with bounded nondeterminism. We consider fixpoints of multivalued functions. We have a standard fixed point theorem, which can be used to model feed back loops. These fixed points can also be obtained by iteration.
openaire   +1 more source

The Gauss-Markov adjunction provides categorical semantics of residuals in supervised learning

Discover Artificial Intelligence
Enhancing the intelligibility and interpretability of machine learning is a crucial task in responding to the demand for Explicability as an AI principle, and in promoting the better social implementation of AI.
Moto Kamiura
doaj   +1 more source

Context Breeds False Memories for Indeterminate Sentences. [PDF]

Front Psychol, 2021
Riven L, de Almeida RG.
europepmc   +1 more source