Sciweavers

4 search results - page 1 / 1
» A linear algorithm for MLL proof net correctness and sequent...
Sort
View
LPAR
2007
Springer
13 years 10 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli
LICS
2008
IEEE
13 years 11 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 8 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass