Results 91 to 100 of about 230,502 (255)
A proof-theoretic view on scheduling in concurrency [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj +1 more source
Philosophical Perspectives, EarlyView.ABSTRACT To measure is to err. Serving both numeric and non‐numeric measurement, the language of measurement refers to margins of error, within which measurement reports locate their measurements. Such reports and reasoning from them invoke what is known and what is known to be known about error‐strewn measurement to derive and contrast the ...
Barry Schein
wiley +1 more source
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus.
Giulio Guerrieri
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 We can use “reason,” with its normative sense, as both a count noun (“there is a reason for her to Φ”) and a mass noun (“there is plenty of reason for her to Φ”). How are the count and mass senses of “reason” related? Daniel Fogal argues that the mass sense is fundamental: Just as lights are merely those things that give light and anxieties ...
Eliot Watkins
wiley +1 more source
An algebraic basis for specifying and enforcing access control in security systems [PDF]
, 2000 Security services in a multi-user environment are often based on access control mechanisms. Static aspects of an access control policy can be formalised using abstract algebraic models.
Pahl, Claus
core
Philosophical Perspectives, EarlyView.ABSTRACT In a pure event semantics for natural language, the domain of quantification and predication is limited to events and states. I offer pure event semantic analyses of several phenomena, some of which have not been treated before in formal semantics. In the pure event semantics sketched in the second section, nouns are state predicates, and this
Roger Schwarzschild
wiley +1 more source
Abstract Hidden Markov Models: a monadic account of quantitative information flow [PDF]
Logical Methods in Computer Science, 2019 Hidden Markov Models, HMM's, are mathematical models of Markov processes with state that is hidden, but from which information can leak. They are typically represented as 3-way joint-probability distributions.
Annabelle McIver +2 more
doaj +1 more source
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
Labelled transition systems as a Stone space [PDF]
Logical Methods in Computer Science, 2005 A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events.
Michael Huth
doaj +1 more source