764 search results - page 112 / 153 » On the Expressibility of Stable Logic Programming |
105
click to vote
POPL
1998
ACM
15 years 4 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
127
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
100
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
118
click to vote
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
113
click to vote
SIGSOFT
2008
ACM
16 years 16 days ago
2008
ACM
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...