Sciweavers

2784 search results - page 4 / 557
» Light analysis of complex systems
Sort
View
IGPL
1998
127views more  IGPL 1998»
13 years 7 months ago
An Analysis of (Linear) Exponentials Based on Extended Sequents
We apply the 2-sequents approach to the analysis of several calculi derived from linear logic. We present a uniform formal system for Linear Logic, Elementary Linear Logic and Lig...
Stefano Guerrini, Simone Martini, Andrea Masini
LOPSTR
1994
Springer
13 years 12 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
SIGGRAPH
2000
ACM
14 years 3 days ago
Plenoptic sampling
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, ...
CSL
2006
Springer
13 years 11 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui