Results 1 to 10 of about 230,502 (255)
Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces [PDF]
Scientific Annals of Computer Science, 2014 In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one ...
B. Valiron, S. Zdancewic
doaj +1 more source
, 2011 Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.
De Nicola, Rocco
core +1 more source
Trace types and denotational semantics for sound programmable inference in probabilistic languages
Proc. ACM Program. Lang., 2019 Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by ...
Alexander K. Lew +4 more
semanticscholar +1 more source
, 2010 The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic ...
Leroy, Xavier
core +4 more sources
On phase semantics and denotational semantics: the exponentials
Annals of Pure and Applied Logic, 2001 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 +3 more sources
Semantics for a Quantum Programming Language by Operator Algebras [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper presents a novel semantics for a quantum programming language by operator algebras, which are known to give a formulation for quantum theory that is alternative to the one by Hilbert spaces.
Kenta Cho
doaj +1 more source
Denotational semantics for timed testing [PDF]
, 1997 In this paper we present a denotational semantics for a timed process algebra, which is fully abstract with respect to the must testing semantics previously developed [Lla96,LdFN96]. The domain of semantic processes is made up of consistent sets of barbs, which generalize the notion of acceptance sets, in such a way that the actions that are offered ...
Llana Díaz, Luis Fernando +1 more
openaire +3 more sources
Unifying Theories of Mobile Channels [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we present the denotational semantics for channel mobility in the Unifying Theories of Programming (UTP) semantics framework. The basis for the model is the UTP theory of reactive processes (precisely, the UTP semantics for Communicating ...
Gerard Ekembe Ngondi
doaj +1 more source
An Effect System for Algebraic Effects and Handlers [PDF]
Logical Methods in Computer Science, 2014 We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style programming language with first-class algebraic effects and handlers. We define an expressive effect system and prove safety of operational semantics with respect
Andrej Bauer, Matija Pretnar
doaj +1 more source
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source