Results 51 to 60 of about 2,907 (227)
The Denotational Semantics of slotted-Circus [PDF]
This paper describes a complete denotational semantics, in the UTP framework, of slotted-Circus , a generic framework for reasoning about discrete timed/synchronously clocked systems. The key result presented here is a comprehensive semantics of the entire language that addresses various semantics issues that have been uncovered, whilst laying ...
Pawel Gancarski, Andrew Butterfield
openaire +2 more sources
This essay introduces the themed cluster of articles, ‘Towards a linguistic anthropology of AI’. The advent of artificial intelligence (AI), especially in large language models capable of producing coherent discourse mimicking conversational interaction, is exerting unprecedented pressure on prevailing concepts of language, personhood, and the human ...
Webb Keane, Constantine V. Nakassis
wiley +1 more source
RedAlert: Determinacy Inference for Prolog [PDF]
This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions ...
JAEL KRIENER +3 more
core +1 more source
The Many-Worlds Calculus [PDF]
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice.
Kostia Chardonnet +3 more
doaj +1 more source
Adventures in time and space [PDF]
This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source
On phase semantics and denotational semantics: the exponentials
An indexed version of propositional linear logic with exponentials is defined together with a sequent calculus for this system. To a formula \(A\) of indexed linear logic are associated: an underlying formula \(\underline{A}\) of linear logic, an interpretation \(|\underline{A}|\) of this formula in the category of sets and relations, and a family ...
Ehrhard, Thomas, Bucciarelli, Antonio
openaire +2 more sources
What does it take to turn a tool into a talking tool and that into an ultimate authority? Generative artificial intelligence (GenAI) in its diverse forms, such as large language models (LLMs), is celebrated as a useful tool. But LLM‐based conversational agents, or chatbots, the software applications through which ordinary users are likely to engage ...
Webb Keane
wiley +1 more source
Facilitating modular property-preserving extensions of programming languages [PDF]
We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on the core. Language features can be described separated from each other in
Claus Pahl, Pahl, Claus
core
Denotational semantics of recursive types in synthetic guarded domain theory [PDF]
Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has ...
Møgelberg, Rasmus Ejlers; id_orcid +4 more
core +1 more source
Probabilistic modal {\mu}-calculus with independent product [PDF]
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +1 more source

