Implementing Relational Specifications in a Constraint Functional Logic Language

Authors:
Rudolf Berghammer;Sebastian Fischer
Affiliations:
Institut für Informatik, Universität Kiel, Olshausenstraße 40, 24098 Kiel, Germany;Institut für Informatik, Universität Kiel, Olshausenstraße 40, 24098 Kiel, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Solving Combinatorial Problems with a Constraint Functional Logic Language

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Semigroupoid interfaces for relation-algebraic programming in haskell

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra

Multi-paradigm declarative languages

ICLP'07 Proceedings of the 23rd international conference on Logic programming
A functional, successor list based version of warshall's algorithm with applications

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Simple rectangle-based functional programs for computing reflexive-transitive closures

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.