Results 11 to 20 of about 3,702,791 (303)
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 2005 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Martin Grohe, Nicole Schweikardt
doaj +3 more sources
Transient analysis and synthesis of linear circuits using constraint logic programming [PDF]
, 1996 In this paper describes the design of a transient analysis program for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R).
Gilbert, D, Jampel, M, Shankar, A
core +6 more sources
Amortised resource analysis with separation logic [PDF]
, 2011 Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete ...
Atkey, Robert
core +4 more sources
Dagger linear logic for categorical quantum mechanics [PDF]
Logical Methods in Computer Science, 2021 Categorical quantum mechanics exploits the dagger compact closed structure of finite dimensional Hilbert spaces, and uses the graphical calculus of string diagrams to facilitate reasoning about finite dimensional processes.
Robin Cockett +2 more
doaj +1 more source
Linear Abadi and Plotkin Logic [PDF]
Logical Methods in Computer Science, 2006 We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a wide ...
Lars Birkedal +2 more
doaj +1 more source
Linear logical approximations [PDF]
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, 2009 The abstract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying operational semantics in a bottom-up, linear logic programming language -- a technique we call "substructural operational semantics" (SSOS) -- manifestly sound program ...
Robert J. Simmons, Frank Pfenning
openaire +2 more sources
A Linear/Producer/Consumer Model of Classical Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?.
Jennifer Paykin, Steve Zdancewic
doaj +1 more source
Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality [PDF]
, 2022 This paper proposes a semantic description of the linear step-like temporal multi-agent logic with the universal modality \(\mathcal{LTK}.sl_U\) based on the idea of non-reflexive non-transitive nature of time.
Zvereva, Tatyana Yu. +1 more
core +1 more source
Proof Diagrams for Multiplicative Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof in sequent ...
Matteo Acclavio
doaj +1 more source
Encoding of Planning Problems and Their Optimizations in Linear Logic [PDF]
, 2009 Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems.
Chrpa, Lukáš +5 more
core +1 more source