Sciweavers

877 search results - page 33 / 176
» Structural Cut Elimination
Sort
View
CSFW
2008
IEEE
14 years 2 months ago
An Authorization Logic With Explicit Time
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
Henry DeYoung, Deepak Garg, Frank Pfenning
ASPDAC
2007
ACM
80views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Implementation of a Standby-Power-Free CAM Based on Complementary Ferroelectric-Capacitor Logic
Abstract-- A complementary ferroelectriccapacitor (CFC) logic-circuit style is proposed for a compact and standby-power-free content-addressable memory (CAM). Since the use of the ...
Shoun Matsunaga, Takahiro Hanyu, Hiromitsu Kimura,...
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
CGA
2005
13 years 7 months ago
Hardware-Assisted Feature Analysis and Visualization of Procedurally Encoded Multifield Volumetric Data
Procedural encoding of scattered and unstructured scalar datasets using Radial Basis Functions (RBF) is an active area of research with great potential for compactly representing ...
Manfred Weiler, Ralf P. Botchen, Simon Stegmaier, ...
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