A Relation Algebraic Semantics for a Lazy Functional Logic Language
From MaRDI portal
Cylindric and polyadic algebras; relation algebras (03G15) Theory of programming languages (68N15) Logic programming (68N17) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Recommendations
Cites work
- An approach to declarative programming based on a rewriting logic
- Declarative Programming with Function Patterns
- Denotation by Transformation
- scientific article; zbMATH DE number 42965 (Why is no real title available?)
- scientific article; zbMATH DE number 1086633 (Why is no real title available?)
- scientific article; zbMATH DE number 1942461 (Why is no real title available?)
- scientific article; zbMATH DE number 1420819 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 3070503 (Why is no real title available?)
- Multi-paradigm Declarative Languages
- On a Tighter Integration of Functional and Logic Programming
- Operational semantics for declarative multi-paradigm languages
- Relation algebraic domain constructions
- Relation-algebraic semantics
Cited in
(3)
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)