Search Results - "Theory of computation Semantics and reasoning Program semantics"

Compositional Semantics for Probabilistic Programs with Exact Conditioning by Stein, Dario, Staton, Sam

“…We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational…”
Get full text

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus by Pistone, Paolo

“…Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to…”
Get full text

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning by Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“…We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in…”
Get full text

From Multisets over Distributions to Distributions over Multisets by Jacobs, Bart

“…A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability. At a technical level, the problem arises…”
Get full text

Enhancing Code Safety in Quantum Intermediate Representation by Luo, Junjie, Zhao, Jianjun

“…Quantum Intermediate Representation (QIR) is an LLVM-based intermediate representation developed by Microsoft for quantum program compilers. QIR is designed to…”
Get full text

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation by Komorida, Yuichi, Katsumata, Shin-ya, Kupke, Clemens, Rot, Jurriaan, Hasuo, Ichiro

“…A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be…”
Get full text

Behavioural Preorders via Graded Monads by Ford, Chase, Milius, Stefan, Schroder, Lutz

“…Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation…”
Get full text

Universal Semantics for the Stochastic λ-Calculus by Azevedo de Amorim, Pedro H., Kozen, Dexter, Mardare, Radu, Panangaden, Prakash, Roberts, Michael

“…We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work…”
Get full text

Fixed-Points for Quantitative Equational Logics by Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related…”
Get full text

An Algebraic Characterisation of First-Order Logic with Neighbour by Manuel, Amaldev, Nevatia, Dhruv

“…We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over…”
Get full text

A Relational Theory of Monadic Rewriting Systems, Part I by Gavazzo, Francesco, Faggian, Claudia

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems. The latter are…”
Get full text

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory by Carette, Titouan, de Visme, Marc, Perdrix, Simon

“…Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite…”
Get full text

On sequentiality and well-bracketing in the π-calculus by Hirschkoff, Daniel, Prebet, Enguerrand, Sangiorgi, Davide

“…The π-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent…”
Get full text

Smart Choices and the Selection Monad by Abadi, Martin, Plotkin, Gordon

“…Describing systems in terms of choices and their resulting costs and rewards promises to free algorithm designers and programmers from specifying how to make…”
Get full text

Positive First-order Logic on Words by Kuperberg, Denis

“…We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
Get full text

SD-Regular Transducer Expressions for Aperiodic Transformations by Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan

“…FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order…”
Get full text

A Compositional Cost Model for the λ-calculus by Laird, James

“…We describe a (time) cost model for the (call-by-value) λ-calculus based on a natural presentation of its game semantics: the cost of computing a finite…”
Get full text

Programs for Cheap by Hackett, Jennifer, Hutton, Graham

“…Write down the definition of a recursion operator on a piece of paper. Tell me its type, but be careful not to let me see the operator's definition. I will…”
Get full text

Learning from, Understanding, and Supporting DevOps Artifacts for Docker by Henkel, Jordan, Bird, Christian, Lahiri, Shuvendu K., Reps, Thomas

“…With the growing use of DevOps tools and frameworks, there is an increased need for tools and techniques that support more than code. The current…”
Get full text

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code by Shashidhar, K. C., Bruynooghe, Maurice, Catthoor, Francky, Janssens, Gerda

“…Development of energy and performance-efficient embedded software is increasingly relying on application of complex transformations on the critical parts of…”
Get full text