1999 search results - page 40 / 400 » Dependently Typed Grammars |
194
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
133
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
145
click to vote
ACL
1998
15 years 7 months ago
1998
In this paper, we present a stochastic language model for Japanese using dependency. The prediction unit in thismodel isallattributeof "bunsetsu". This isrepresented by ...
148
click to vote
ACL
1990
15 years 7 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
168
click to vote
OOPSLA
2007
Springer
16 years 6 days ago
2007
Springer
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...