277 search results - page 35 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
KR
2004
Springer
14 years 29 days ago
2004
Springer
When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various t...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
LPNMR
2001
Springer
14 years 1 days ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...