615 search results - page 2 / 123 » Beta Reduction Constraints |
103
click to vote
TCS
2008
15 years 1 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
122
click to vote
IJON
2008
15 years 1 months ago
2008
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
126
click to vote
CDES
2006
15 years 3 months ago
2006
Predicting protein secondary structure is a key step in determining the 3D structure of a protein that determines its function. The Dictionary of Secondary Structure of Proteins (...
130
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
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...
POPL
2000
ACM
15 years 6 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...