Sciweavers

14 search results - page 1 / 3
» csl 1999
Sort
View
153
Voted
CSL
1999
Springer
15 years 11 months ago
Term Rewriting
Aart Middeldorp
155
Voted
CSL
1999
Springer
15 years 11 months ago
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
Thorsten Altenkirch, Bernhard Reus
193
Voted
CSL
1999
Springer
15 years 7 months ago
Confidence measures from local posterior probability estimates
Gethin Williams, Steve Renals
178
Voted
CSL
1999
Springer
15 years 11 months ago
Choice Logic Programs and Nash Equilibria in Strategic Games
Marina De Vos, Dirk Vermeir
175
Voted
CSL
1999
Springer
15 years 7 months ago
A P-Time Completeness Proof for Light Logics
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
Luca Roversi