1999 search results - page 51 / 400 » Dependently Typed Grammars |
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
132
click to vote
ISMB
1994
15 years 3 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
105
click to vote
BIRTHDAY
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
125
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
100
click to vote
MSCS
2008
15 years 1 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...