Sciweavers

852 search results - page 69 / 171
» entcs 2010
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
14 years 11 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
ENTCS
2007
99views more  ENTCS 2007»
14 years 11 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
ENTCS
2007
104views more  ENTCS 2007»
14 years 11 months ago
Amb Breaks Well-Pointedness, Ground Amb Doesn't
McCarthy’s amb operator has no known denotational semantics, and its basic operational properties - the context lemma, the compatibility of refinement similarity and convex bis...
Paul Blain Levy
ENTCS
2007
86views more  ENTCS 2007»
14 years 11 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée
ENTCS
2007
97views more  ENTCS 2007»
14 years 11 months ago
Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...