A Relation Algebraic Semantics for a Lazy Functional Logic Language
DOI10.1007/978-3-540-78913-0_5zbMATH Open1138.68345OpenAlexW1801920691MaRDI QIDQ3498404FDOQ3498404
Authors: Bernd Braßel, Jan Christiansen
Publication date: 15 May 2008
Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_5
Recommendations
Theory of programming languages (68N15) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- Relation-algebraic semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-paradigm Declarative Languages
- Title not available (Why is that?)
- Relation algebraic domain constructions
- An approach to declarative programming based on a rewriting logic
- Declarative Programming with Function Patterns
- Operational semantics for declarative multi-paradigm languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a Tighter Integration of Functional and Logic Programming
- Denotation by Transformation
Cited In (3)
Uses Software
This page was built for publication: A Relation Algebraic Semantics for a Lazy Functional Logic Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498404)