Results 51 to 60 of about 11,766 (228)
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
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
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
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
RedAlert: Determinacy Inference for Prolog [PDF]
, 2011 This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions ...
King, Andy, Kriener, Jael
core +3 more sources
What are particularistic pejoratives?
Mind &Language, EarlyView.Particularistic pejoratives (PPs) mock individuals based on their personal attributes yet lack a precise definition. This paper seeks to refine our understanding of PPs by examining their derogatory profiles across three dimensions: descriptiveness, intensity, and slurring potential.
Víctor Carranza‐Pinedo
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
A Metalanguage for Guarded Iteration
, 2018 Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying ...
A Carboni +27 more
core +1 more source
Philosophical Perspectives, EarlyView.ABSTRACT Joint inquiry requires agents to exchange public content about some target domain, which in turn requires them to track which content a linguistic form contributes to a conversation. But, often, the inquiry delivers a necessary truth. For example, if we are inquiring whether a particular bird, Tweety, is a woodpecker, and discover that it is ...
Una Stojnić, Matthew Stone
wiley +1 more source