Implementing Relational Specifications in a Constraint Functional Logic Language | Zendy

Rudolf Berghammer | Zendy; Sebastian Fischer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementing Relational Specifications in a Constraint Functional Logic Language

Author(s) -

Rudolf Berghammer,

Sebastian Fischer

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.01.011

Subject(s) - computer science , programming language , relational algebra , relational calculus , theoretical computer science , functional programming , constraint satisfaction problem , relational model , algebra over a field , relational database , mathematics , artificial intelligence , database , pure mathematics , probabilistic logic

We show how the algebra of (finite, binary) relations and the features of the integrated functional logic programming language Curry can be employed to solve problems on relational structures (like orders, graphs, and Petri nets) in a very high-level declarative style. The functional features of Curry are used to implement relation algebra and the logic features of the language are combined with BDD-based solving of boolean constraints to obtain a fairly efficient implementation of a solver for relational specifications

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research