Results 61 to 70 of about 2,593,900 (78)
Logic Column 10: Specifying Confidentiality [PDF]
SIGACT News, 35(4), pp. 72-83, 2004, 2004 This article illustrates the use of a logical specification language to capture various forms of confidentiality properties used in the security literature.
arxiv
Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra [PDF]
arXiv, 2006 This article surveys recent advances in applying algebraic techniques to constraint satisfaction problems.
arxiv
A feasible algorithm for typing in Elementary Affine Logic
, 2004 We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction.
A. Asperti +10 more
core +4 more sources
arXiv, 2011 We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.
arxiv
A progression ring for interfaces of instruction sequences, threads, and services [PDF]
, 2009 We define focus-method interfaces and some connections between such interfaces and instruction sequences, giving rise to instruction sequence components. We provide a flexible and practical notation for interfaces using an abstract datatype specification
Bergstra, Jan A., Ponse, Alban
core +1 more source
On Hoare-McCarthy algebras [PDF]
, 2010 We discuss an algebraic approach to propositional logic with side effects. To this end, we use Hoare's conditional [1985], which is a ternary connective comparable to if-then-else.
Bergstra, Jan A., Ponse, Alban
core +1 more source
Justification logic enjoys the strong finite model property [PDF]
arXiv, 2015 We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.
arxiv
Inversion, Iteration, and the Art of Dual Wielding
, 2019 The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).
Kaarsgaard, Robin
core +1 more source
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic [PDF]
ACM Transactions on Computational Logic, vol 7 (2006) pp. 219 -
260., 2003 We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
arxiv
Sintesi di algoritmi con SKY [PDF]
arXiv, 2001 This paper describes the semantics and ideas about SKY, a logic programming language intended in order to specify algorithmic strategies for the evaluation of problems.
arxiv