3736 search results - page 377 / 748 » Generative Programming |
147
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
148
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
272
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
124
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
116
click to vote
ACISICIS
2009
IEEE
15 years 9 months ago
2009
IEEE
Grammars, especially context-free grammars, are widely used within and even outside the field of computer science. In this paper, we present a systematic framework for grammar te...