Results 41 to 50 of about 11,543 (183)
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
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
, 2014 We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.
Bistarelli, Stefano +3 more
core +1 more source
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
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
McDowell and Sellars on Objective Purport
European Journal of Philosophy, EarlyView.Abstract John McDowell has criticized Wilfrid Sellars on several occasions and over a number of years for his ‘non‐relational’ account of intentionality. This account is, according to McDowell, at least partly responsible for a ‘blind spot’ in Sellars's thinking: Sellars, allegedly, fails to see how objects or states of affairs in the external world ...
Stefan Brandt
wiley +1 more source
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
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
Linear Haskell: practical linearity in a higher-order polymorphic language [PDF]
, 2017 Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards ...
Bernardy, Jean-Philippe +4 more
core +3 more sources
Uniquely human temporal thoughts
Mind &Language, EarlyView.Life on Earth will eventually come to an end. The thought expressed in the previous sentence is about a point in time that is not known to the individual entertaining the thought. This paper is concerned with the nature of such temporal thoughts. We propose that the capacity to mentally represent thoughts about non‐specific temporal intervals is a ...
İsa Kerem Bayırlı
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