Sciweavers

3658 search results - page 73 / 732
» The logic of proofs, semantically
Sort
View
CSL
2010
Springer
13 years 10 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
JSYML
2010
107views more  JSYML 2010»
13 years 7 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
PLPV
2012
ACM
12 years 4 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
ESOP
2010
Springer
14 years 6 months ago
Logical Concurrency Control From Sequential Proofs
G. Ramalingam, Jyotirmoy V. Deshmukh, Kapil Vaswan...
ICLP
2010
Springer
14 years 1 months ago
Focused Proof Search for Linear Logic in the Calculus of Structures
The proof-theoretic approach to logic programming has benefited from the
Nicolas Guenot