Functions as passive constraints in LIFE

@article{AtKaci1994FunctionsAP,
  title={Functions as passive constraints in LIFE},
  author={Hassan A{\"i}t-Kaci and Andreas Podelski},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={16},
  pages={1279-1318}
}
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… 

Figures from this paper

Confluence and Semantics of Constraint Simplification Rules

Declarative and operational semantics as well as soundness and completeness results for CSR programs are given and a notion of confluence, an essential syntactical property of any constraint solver, is introduced.

Towards a Meaning of LIFE

A Feature Constraint System for Logic Programming with Entailment

A Simple Life Su Doku Solver

This work presents a simple and purely declarative specification of the popular numb er puzzle Su Doku, which yields a surprisingly efficient Su Dokusolver although the “ alldifferent” constraint is not native to LIFE.

Connuence and Semantics of Constraint Simpliication Rules Connuence and Semantics of Constraint Simplication Rules

Declarative and operational semantics as well as soundness and completeness results for CSR programs are given and connuence of a program implies consistency of its logical meaning (under a mild restriction) is shown.

Extending Unification Formalisms

This paper describes some of the results of the project The Reusability of Grammatical Resources. The aim of the project is to extend current grammar formalisms with notational devices and constraint

Teaching Functional and Logic Programming with a Single Computational Model

It is shown that it is possible to teach the ideas of modern functional languages like Haskell and logic programming on the basis of a single computation model, and the structure of a course based on it is described.

Situated Simplification

...

References

SHOWING 1-10 OF 91 REFERENCES

Constraint logic programming

A class of programming languages, the CLP languages, are defined, all of which share the same essential semantic properties, and are highly declarative and are soundly based within a unified framework of formal semantics.

Integrating logic and functional programming

This work proposes a computation delaying mechanism called residuation built into the unification operation which may then account forβ-reduction, and describes an operational semantics and an implementation of a prototype language called LeFun—Logic, equations, and Functions.

Records for Logic Programming

Deenite Relations over Constraint Languages

This paper shows that the nice properties of logic programs extend to deenite clause speciications over arbitrary constraint languages, and establishes a notion of well-typedness that is decidable provided the underlying constraint language isDecidable.

A Feature-Based Constraint System for Logic Programming with Entailment

An incremental entailment simplification simplification system that is proved to be sound and complete, and a proof showing that FT satisfies the so-called " independence of negative constraints".

Towards a Meaning of LIFE

An Algebraic Semantics Approach to the Effective Resolution of Type Equations

Structural operational semantics for AKL

...