1598 search results - page 100 / 320 » A Unified Computation Model for Functional and Logic Program... |
139
click to vote
LPNMR
1997
Springer
15 years 8 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
161
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
134
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...
176
click to vote
FSTTCS
2005
Springer
15 years 10 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
129
click to vote
IGPL
2008
15 years 4 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...