A Relation Algebraic Semantics for a Lazy Functional Logic Language

DOI10.1007/978-3-540-78913-0_5zbMath1138.68345OpenAlexW1801920691MaRDI QIDQ3498404

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (2)

Unnamed Item ⋮ Denotation by Transformation

Uses Software

• PAKCS

Cites Work

• Relation algebraic domain constructions
• Relation-algebraic semantics
• Operational semantics for declarative multi-paradigm languages
• On a Tighter Integration of Functional and Logic Programming
• Multi-paradigm Declarative Languages
• An approach to declarative programming based on a rewriting logic
• Declarative Programming with Function Patterns
• Denotation by Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Relation Algebraic Semantics for a Lazy Functional Logic Language