Results 1 to 10 of about 1,184,149 (273)
Palaeohispanica. Revista sobre lenguas y culturas de la Hispania Antigua, 2019 Eugenio R. Luján
openalex +2 more sources
Banach Spaces as Data Types [PDF]
Logical Methods in Computer Science, 2011 We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space.
Dag Normann
doaj +1 more source
Logical Methods in Computer Science, 2017 We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not.
Massimo Bartoletti +3 more
doaj +1 more source
A Denotational Semantics for SPARC TSO [PDF]
Logical Methods in Computer Science, 2019 The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult.
Ryan Kavanagh, Stephen Brookes
doaj +1 more source
Logical Reasoning for Higher-Order Functions with Local State [PDF]
Logical Methods in Computer Science, 2008 We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-like local reference generation. Local references may be generated dynamically and exported outside their scope, may store higher-order functions and may be used to
Nobuko Yoshida +2 more
doaj +1 more source
Finite dimensional Hilbert spaces are complete for dagger compact closed categories [PDF]
Logical Methods in Computer Science, 2012 We show that an equation follows from the axioms of dagger compact closed categories if and only if it holds in finite dimensional Hilbert spaces.
Peter Selinger
doaj +1 more source
Healthiness from Duality [PDF]
Logic in Computer Science, 2016 Healthiness is a good old question in program logics that dates back to Dijkstra. It asks for an intrinsic characterization of those predicate transformers which arise as the (backward) interpretation of a certain class of programs.
W. Hino +3 more
semanticscholar +1 more source
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
Revisiting Decidable Bounded Quantification, via Dinaturality [PDF]
Electronic Notes in Theoretical Informatics and Computer Science,
Volume 1 - Proceedings of MFPS XXXVIII (February 22, 2023) entics:10474, 2022 We use a semantic interpretation to investigate the problem of defining an expressive but decidable type system with bounded quantification. Typechecking in the widely studied System Fsub is undecidable thanks to an undecidable subtyping relation, for which the culprit is the rule for subtyping bounded quantification.
arxiv +1 more source
Existence of strongly proper dyadic subbases [PDF]
Logical Methods in Computer Science, 2017 We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets.
Yasuyuki Tsukamoto
doaj +1 more source