Results 71 to 80 of about 230,502 (255)
IMP with exceptions over decorated logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj +1 more source
Modularity in Denotational Semantics
Electronic Notes in Theoretical Computer Science, 1997 AbstractWe consider a modular approach to denotational semantics. We reformulate and extend the idea of monads as notions of computation to algebraic structure together with a construction of an extended semantic category. We show that upon making that reformulation, one can obtain some account of modularity, in particular accounting for the ...
openaire +2 more sources
The Many-Worlds Calculus [PDF]
Logical Methods in Computer ScienceIn this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice.
Kostia Chardonnet +3 more
doaj +1 more source
Our(?) Concept of Food or, They are Eating Their Pets
European Journal of Philosophy, EarlyView.Abstract This article examines the idea that deep disagreements are best understood as rooted in conceptual differences rather than differences in judgments and opinions, by means of a reflection on the differences between a vegan and a meat eater. The aim is not to develop a new theory of “deep disagreement” but to gain clarity about one field in ...
Niklas Forsberg
wiley +1 more source
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +1 more source
Theorem proving support in programming language semantics [PDF]
, 2007 We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system.
Bertot, Yves
core +3 more sources
The Measurement Calculus [PDF]
, 2007 Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation.
Abramsky S. +21 more
core +3 more sources
Illinois-LH: A Denotational and Distributional Approach to Semantics
International Workshop on Semantic Evaluation, 2014 This paper describes and analyzes our SemEval 2014 Task 1 system. Its features are based on distributional and denotational similarities; word alignment; negation; and hypernym/hyponym, synonym, and antonym relations.
Alice Lai, J. Hockenmaier
semanticscholar +1 more source
Polysemy and roots: Deep versus shallow fetching
Mind &Language, EarlyView.The paper argues for a model of polysemy based on the blueprint offered by Paul Pietroski whereby the meaning of a lexical item is an instruction to fetch a concept from an address. We show that the bare idea of fetching admits of a deep construal, where a concept is fetched, and a shallow construal, where the instruction merely links a lexical item to
John Collins, Tamara Dobler
wiley +1 more source
Adventures in time and space [PDF]
Logical Methods in Computer Science, 2007 This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source