First Sentence:
The Andorra Kernel Language's (AKL, see [10]) computational model addresses the matter of handling nondeterminism in a different way than Prolog, ie. a computation does not explore the solution space by exploring a derivation tree but rather by deploying a sequence of configurations (see [9] for an introduction to this subject).
Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
partial inductive definitions, proof search state, definitional reflection, exc structures, general proof tree, distributed unification, atomic judgments, succedent rules, intuitionistic context, regular search space, different allocation policies, finite exclusions, kind list type, object level sequent, sequential logic programming, intended queries, succ function, clause managers, unification tree, concurrent logic programs, guard evaluation, definitional clauses, failure axiom, procedural behavior, consistent instantiations
Key Phrases - Capitalized Phrases (CAPs):
(learn more)
Computer Science, International Conference, Dale Miller, Lecture Notes, Concurrent Prolog, Research Report, Name State, New Generation Computing, New York, Gopalan Nadathur, Morgan Kaufmann, Cambridge University Press, Academic Press, Harold Boley, Logical Frameworks, Philippe Codognet, University of Pennsylvania, Computer Society Press, Journal of Automated Reasoning, Universidade Nova de Lisboa, Chalmers University of Technology, Edinburgh Logical Framework, Evaluation of Method, Implementations of Prolog, Michael Sintek
New!
Books on Related Topics |
Concordance
|
Text Stats
Browse Sample Pages:
Front Cover |
Table of Contents |
First Pages |
Back Cover |
Surprise Me!