Results 31 to 40 of about 1,543,905 (277)
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies [PDF]
Logical Methods in Computer Science, 2010 We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs.
Jeroen Ketema, Jakob Grue Simonsen
doaj +1 more source
Security Policies as Membranes in Systems for Global Computing [PDF]
Logical Methods in Computer Science, 2005 We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane, which regulates the interactions between the computing body ...
Daniele Gorla +2 more
doaj +1 more source
The Cepheids of Centaurus A (NGC 5128) and Implications for H0 [PDF]
, 2010 An analysis based on new OGLE observations reaffirms Ferrarese et al. discovery of 5 Type II Cepheids in NGC 5128. The distance to that comparatively unreddened population is d=3.8+-0.4(se) Mpc. The classical Cepheids in NGC 5128 are the most obscured in
Majaess, Daniel J.
core +2 more sources
A Type System For Call-By-Name Exceptions [PDF]
Logical Methods in Computer Science, 2009 We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs that may raise ...
Sylvain Lebresne
doaj +1 more source
Coaxioms: flexible coinductive definitions by inference systems [PDF]
Logical Methods in Computer Science, 2020 We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which can only be ...
Francesco Dagnino
doaj +1 more source
Generative Unbinding of Names [PDF]
Logical Methods in Computer Science, 2008 This paper is concerned with the form of typed name binding used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name,value)-pair that may only be deconstructed via the generation of ...
Andrew M. Pitts, Mark R. Shinwell
doaj +1 more source
Independence and concurrent separation logic [PDF]
Logical Methods in Computer Science, 2008 A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the ...
Jonathan Hayman, Glynn Winskel
doaj +1 more source
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus [PDF]
Logical Methods in Computer Science, 2008 Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.'s DCC in terms of logical relations and given a proof of noninterference by reduction to parametricity of System F. Unfortunately, their proof contains errors in a key lemma
Naokata Shikuma, Atsushi Igarashi
doaj +1 more source
Logical Methods in Computer Science, 2017 This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching.
Grigore Rosu
doaj +1 more source
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus [PDF]
Logical Methods in Computer Science, 2017 We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant ...
Giulio Guerrieri +2 more
doaj +1 more source