Sciweavers

244 search results - page 26 / 49
» A Way to Interpret Lukasiewicz Logic and Basic Logic
Sort
View
CONCUR
2005
Springer
14 years 1 months ago
Type-Directed Concurrency
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
Deepak Garg, Frank Pfenning
DAS
2008
Springer
13 years 9 months ago
On the Reading of Tables of Contents
This paper presents a framework for understanding tables of contents (TOC) of books, journals, and magazines. We propose a universal logical structure representation in terms of a...
Prateek Sarkar, Eric Saund
MSCS
2007
125views more  MSCS 2007»
13 years 7 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
FSTTCS
2005
Springer
14 years 1 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
ICFP
2008
ACM
14 years 7 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...