Results 21 to 30 of about 228,658 (258)
Smart Choices and the Selection Monad [PDF]
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized by ...
Martin Abadi, Gordon Plotkin
doaj +1 more source
Null values in data base management a denotational semantics approach [PDF]
Yannis Vassiliou
openalex +2 more sources
Denotational Semantics for occam [PDF]
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 ...
A. W. Roscoe
semanticscholar +4 more sources
A straightforward denotational semantics for non-determinate data flow programs [PDF]
Paul R. Kosinski
openalex +2 more sources
Denotational Semantics of A User-Oriented, Domain-Specific Language [PDF]
This paper presents the formal definition of a domain-specific language, named Pantagruel, following the methodology proposed by David Schmidt for language development.
Julien Mercadal+2 more
doaj +1 more source
Denotational Semantics with Nominal Scott Domains
Steffen Lösch, Andrew M. Pitts
openalex +3 more sources
The language Eff is an OCaml-like language serving as a prototype implementation of the theory of algebraic effects, intended for experimentation with algebraic effects on a large scale.
Oleg Kiselyov, KC Sivaramakrishnan
doaj +1 more source
Abstract Interpretation as a Programming Language [PDF]
In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.
Mads Rosendahl
doaj +1 more source
Neural Compositional Denotational Semantics for Question Answering [PDF]
Answering compositional questions requiring multi-step reasoning is challenging. We introduce an end-to-end differentiable model for interpreting questions about a knowledge graph (KG), which is inspired by formal approaches to semantics.
Nitish Gupta, M. Lewis
semanticscholar +1 more source
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications.
Jiri Adamek, Stefan Milius, Jiri Velebil
doaj +1 more source