Login: A logic programming language with built-in inheritance
Journal of Logic Programming
Negations and quantifiers in NU-Prolog
Proceedings on Third international conference on logic programming
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Foundations of deductive databases and logic programming
Kernel Andorra Prolog and its computation model
Logic programming
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
Structural operational semantics for AKL
Future Generation Computer Systems - Special issue: PARLE 91
A feature constraint system for logic programming with entailment
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Entailment and Disentailment of Order-Sorted Feature Constraints
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Incremental Algorithms for Constraint Solving and Entailment over Rational Trees
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Deterministic consistency checking of LP constraints
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
LIFE is a programming language proposing to integrate logic programming, functional programming, and object-oriented programming. It replaces first-order terms with &psgr;-terms, data structures that allow computing with partial information. These are approximation structures denoting sets of values. LIFE further enriches the expressiveness of &psgr;-terms with functional dependency constraints. We must explain the meaning and use of functions in LIFE declaratively, as solving partial information constraints. These constraints do not attempt to generate their solutions but behave as demons filtering out anything else. In this manner, LIFE functions act as declarative coroutines. We need to show that the &psgr;-term's approximation semantics is congruent with an operational semantics viewing functional reduction as an effective enforcing of passive constraints. In this article, we develop a general formal framework for entailment and disentailment of constraints based on a technique called relative simplification. We study its operational and semantical properties, and we use it to account for functional application over &psgr;-terms in LIFE.