Results 31 to 40 of about 230,502 (255)
Denotational Semantics of A User-Oriented, Domain-Specific Language [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 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
Quantum Alternation: Prospects and Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement.
Costin Bădescu, Prakash Panangaden
doaj +1 more source
Denotational Semantics with Nominal Scott Domains
JACM, 2014 Steffen Lösch, A. Pitts
semanticscholar +3 more sources
A Denotational Semantics for Communicating Unstructured Code [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 An important property of programming language semantics is that they should be compositional. However, unstructured low-level code contains goto-like commands making it hard to define a semantics that is compositional. In this paper, we follow the ideas
Nils Jähnig +2 more
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
Neural Compositional Denotational Semantics for Question Answering [PDF]
Conference on Empirical Methods in Natural Language Processing, 2018 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
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
Denotational semantics for guarded dependent type theory [PDF]
Mathematical Structures in Computer Science, 2018 We present a new model of guarded dependent type theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs
A. Bizjak, R. E. Møgelberg
semanticscholar +1 more source
Denotational semantics of recursive types in synthetic guarded domain theory [PDF]
Logic in Computer Science, 2016 Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general ...
Rasmus E. Møgelberg, M. Paviotti
semanticscholar +1 more source