584 search results - page 50 / 117 » Logic Programs as term Rewriting Systems |
138
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
146
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
137
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
116
click to vote
ICFP
2010
ACM
15 years 6 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
140
click to vote
LICS
1989
IEEE
15 years 8 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...