2604 search results - page 97 / 521 » General constant expressions for system programming language... |
SAS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
LICS
1994
IEEE
14 years 1 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
ICALP
1995
Springer
14 years 15 days ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...