2236 search results - page 128 / 448 » Language Independence and Language Tolerance in Logic Progra... |
164
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
162
click to vote
ICTAC
2005
Springer
15 years 12 months ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
165
click to vote
PPDP
2009
Springer
16 years 29 days ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
164
click to vote
PEPM
2007
ACM
16 years 16 days ago
2007
ACM
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
168
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...