Results 71 to 80 of about 2,907 (227)

Denotational semantics for occam [PDF]

, 1985
A denotational semantics is given for a large subset of occam, a programming language for concurrent systems. The semantic domain used is a "failure-sets" model modified to allow machine states to be properly dealt with. The applications of the semantics are discussed briefly, and we see how the natural congruence induced by the semantics allows us to ...
openaire   +2 more sources

Denotational and operational semantics for prolog

The Journal of Logic Programming, 1988
The semantics of PROLOG programs is usually given in terms of the model theory of first-order logic. However, this does not adequately characterize the computational behavior of PROLOG programs. PROLOG implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as nonlogical ...
Saumya K. Debray, Prateek Mishra
openaire   +1 more source

The I in logic

Theoria, EarlyView.
Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley   +1 more source

A proof-theoretic view on scheduling in concurrency [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj   +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

Denotational semantics in Synthetic Guarded Domain Theory [PDF]

, 2016
In functional programming, features such as recursion, recursive types and general references are central. To define semantics of this kind of languages one needs to come up with certain definitions which may be non-trivial to show well-defined.
Paviotti, Marco
core   +2 more sources

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

Delomization, or the esoteric Nechung kang so, the Dalai Lama, and exilic imaginings of a Tibetan community

Journal of Linguistic Anthropology, Volume 36, Issue 2, August 2026.
Abstract I propose the concept of delomization, the process whereby a sign comes to be understood as a symbol. I term such signs delomes. With rhematization and dicentization, delomization completes the triplet that linguistic anthropologists derive from Charles Sanders Peirce's third trichotomy.
Urmila Nair
wiley   +1 more source

Etymology and entomology: The semiotics and ethics of multispecies gene nomenclatures

Journal of Linguistic Anthropology, Volume 36, Issue 2, August 2026.
Abstract This article examines controversies surrounding gene names that are perceived as humorous in the context of fruit flies but are considered rude in the clinical context of human medicine. Drawing on ethnographic fieldwork in insect laboratories, interviews with entomologists and geneticists, and an analysis of scientific and clinical ...
Colin M. E. Halverson
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, Carroll Morgan, Tahiry Rabehaja   +2 more
doaj   +1 more source