279 search results - page 18 / 56 » Determinacy Inference for Logic Programs |
151
Voted
LPNMR
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
142
Voted
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
165
Voted
LICS
2008
IEEE
16 years 23 days ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
162
Voted
DALT
2006
Springer
15 years 10 months ago
2006
Springer
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
185
Voted
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...