1999 search results - page 11 / 400 » Dependently Typed Grammars |
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
JFP
2007
14 years 11 months ago
2007
We present an approach to enriching the type system of ML with a restricted form of de
101
click to vote
NIPS
2008
15 years 1 months ago
2008
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
GRAMMARS
2000
14 years 11 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...