Sciweavers

1389 search results - page 122 / 278
» Lightweight dependent classes
Sort
View
ECML
2003
Springer
15 years 4 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 4 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
ICSM
2002
IEEE
15 years 4 months ago
Constructing Precise Object Relation Diagrams
The Object Relation Diagram (ORD) of a program is a class interdependence diagram which has applications in a wide variety of software engineering problems (e.g., integration test...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 3 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
DLS
2005
122views Languages» more  DLS 2005»
15 years 1 months ago
Language constructs for context-oriented programming: an overview of ContextL
ContextL is an extension to the Common Lisp Object System that allows for Context-oriented Programming. It provides means to associate partial class and method definitions with l...
Pascal Costanza, Robert Hirschfeld