Results 11 to 20 of about 1,142,282 (251)
Refining Inductive Types [PDF]
Logical Methods in Computer Science, 2012 Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information.
Robert Atkey +2 more
doaj +1 more source
On the strength of proof-irrelevant type theories [PDF]
Logical Methods in Computer Science, 2008 We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover.
Benjamin Werner
doaj +1 more source
Formalization of Abstract State Transition Systems for SAT [PDF]
Logical Methods in Computer Science, 2011 We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver's global variables ...
Filip Maric, Predrag Janicic
doaj +1 more source
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source
QRB-Domains and the Probabilistic Powerdomain [PDF]
Logical Methods in Computer Science, 2012 Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj +1 more source
Reasoning about Strategies: on the Satisfiability Problem [PDF]
Logical Methods in Computer Science, 2017 Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games.
Fabio Mogavero +3 more
doaj +1 more source
Interactive Small-Step Algorithms I: Axiomatization [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 more
doaj +1 more source
Expressiveness of Metric modalities for continuous time [PDF]
Logical Methods in Computer Science, 2007 We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.
Yoram Hirshfeld, Alexander Rabinovich
doaj +1 more source
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Ambulatory Measurement of Ground Reaction Forces [PDF]
, 2004 The measurement of ground reaction forces is important in the biomechanical analysis of gait and other motor activities. It is the purpose of this study to show the feasibility of ambulatory measurement of ground reaction forces using two six degrees of ...
Droog, Ed +2 more
core +4 more sources