Results 11 to 20 of about 1,319,448 (268)
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories [PDF]
Logical Methods in Computer Science, 2017 Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes.
Makoto Hamana
doaj +1 more source
On the meaning of logical completeness [PDF]
Logical Methods in Computer Science, 2010 Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs.
Michele Basaldella, Kazushige Terui
doaj +1 more source
A rich hierarchy of functionals of finite types [PDF]
Logical Methods in Computer Science, 2009 We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the Urysohn space
Dag Normann
doaj +1 more source
Permission-Based Separation Logic for Message-Passing Concurrency [PDF]
Logical Methods in Computer Science, 2011 We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language ...
Adrian Francalanza +2 more
doaj +1 more source
Coalgebraic trace semantics via forgetful logics [PDF]
Logical Methods in Computer Science, 2017 We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative ...
Bartek Klin, Jurriaan Rot
doaj +1 more source
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems [PDF]
Logical Methods in Computer Science, 2008 Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity.
Franck van Breugel +2 more
doaj +1 more source
Semantics of Typed Lambda-Calculus with Constructors [PDF]
Logical Methods in Computer Science, 2011 We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic constructors.
Barbara Petit
doaj +1 more source
Conway games, algebraically and coalgebraically [PDF]
Logical Methods in Computer Science, 2011 Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we ...
Furio Honsell, Marina Lenisa
doaj +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
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +1 more source