Sciweavers

1686 search results - page 82 / 338
» Higher Order Deforestation
Sort
View
CSL
2002
Springer
15 years 3 months ago
Open Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Herman Geuvers, Gueorgui I. Jojgov
ENTCS
2002
136views more  ENTCS 2002»
15 years 3 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
SCP
1998
113views more  SCP 1998»
15 years 3 months ago
Linear-Time Hierarchies for a Functional Language Machine Model
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
Eva Rose
EMNLP
2009
15 years 1 months ago
Less is More: Significance-Based N-gram Selection for Smaller, Better Language Models
The recent availability of large corpora for training N-gram language models has shown the utility of models of higher order than just trigrams. In this paper, we investigate meth...
Robert C. Moore, Chris Quirk
JMLR
2010
135views more  JMLR 2010»
14 years 10 months ago
Structured Prediction Cascades
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
David Weiss, Benjamin Taskar