Results 11 to 20 of about 11,408 (204)
On the equivalence of game and denotational semantics for the probabilistic mu-calculus [PDF]
Logical Methods in Computer Science, 2012 The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS).
Matteo Mio
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2018 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]
Electronic Proceedings in Theoretical Computer Science, 2013 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
Logical Methods in Computer Science, 2006 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
Decorated proofs for computational effects: States [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the ...
Jean-Guillaume Dumas +3 more
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2013 We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded.
Alberto Carraro +2 more
doaj +1 more source
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory [PDF]
Logical Methods in Computer Science, 2020 Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract form of step ...
Bassel Mannaa +2 more
doaj +1 more source
Analyzing logic programs with dynamic scheduling [PDF]
, 1994 Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in ...
García de la Banda, M. +2 more
core +2 more sources
A Denotational Semantics for First-Order Logic [PDF]
, 2000 In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.
E. M. Clarke +9 more
core +8 more sources
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 +2 more
openaire +5 more sources