GATE: a simulation toolkit for PET and SPECT
Monte Carlo simulation is an essential tool in emission tomography that can assist in the
design of new medical imaging devices, the optimization of acquisition protocols and the …
design of new medical imaging devices, the optimization of acquisition protocols and the …
(Leftmost-outermost) beta reduction is invariant, indeed
B Accattoli, U Dal Lago - Logical Methods in Computer …, 2016 - lmcs.episciences.org
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can
simulate each other within a polynomially overhead in time. Is lambda-calculus a …
simulate each other within a polynomially overhead in time. Is lambda-calculus a …
Light types for polynomial time computation in lambda calculus
P Baillot, K Terui - Information and Computation, 2009 - Elsevier
We present a polymorphic type system for lambda calculus ensuring that well-typed
programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a …
programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a …
Light types for polynomial time computation in lambda-calculus
P Baillot, K Terui - Proceedings of the 19th Annual IEEE …, 2004 - ieeexplore.ieee.org
We propose a new type system for lambda-calculus ensuring that well-typed programs can
be executed in polynomial time: dual light affine logic (DIAL). DIAL has a simple type …
be executed in polynomial time: dual light affine logic (DIAL). DIAL has a simple type …
Beta reduction is invariant, indeed
B Accattoli, U Dal Lago - Proceedings of the Joint Meeting of the Twenty …, 2014 - dl.acm.org
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can
simulate each other within a polynomially overhead in time. Is λ-calculus a reasonable …
simulate each other within a polynomially overhead in time. Is λ-calculus a reasonable …
A Soft Type Assignment System for λ-Calculus
M Gaboardi, S Ronchi Della Rocca - International Workshop on Computer …, 2007 - Springer
Abstract Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted
rules for exponentials, which is correct and complete for PTIME. We design a type …
rules for exponentials, which is correct and complete for PTIME. We design a type …
A logical account of PSPACE
M Gaboardi, JY Marion, SR Della Rocca - ACM SIGPLAN Notices, 2008 - dl.acm.org
We propose a characterization of PSPACE by means of atype assignment for an extension
of lambda calculus with a conditional construction. The type assignment STAB is an …
of lambda calculus with a conditional construction. The type assignment STAB is an …
An implicit characterization of pspace
M Gaboardi, JY Marion… - ACM Transactions on …, 2012 - dl.acm.org
We present a type system for an extension of lambda calculus with a conditional
construction, named STAB, that characterizes the PSPACE class. This system is obtained by …
construction, named STAB, that characterizes the PSPACE class. This system is obtained by …
Verification of ptime reducibility for system F terms: Type inference in dual light affine logic
V Atassi, P Baillot, K Terui - Logical Methods in Computer …, 2007 - lmcs.episciences.org
In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of
Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms …
Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms …
[HTML][HTML] On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
P Baillot - Information and Computation, 2015 - Elsevier
Elementary linear logic is a simple variant of linear logic due to Girard and which
characterizes in the proofs-as-programs approach the class of elementary functions, that is …
characterizes in the proofs-as-programs approach the class of elementary functions, that is …