scientific article; zbMATH DE number 1086633

MaRDI QIDQ4362882zbMATH OpenFDO

Authors Rudolf Berghammer, Burghard von Karger

Publication date 13 November 1997

zbMATH Keywords

functional languagetermination problems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Relational algebraic semantics of deterministic and nondeterministic programs
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• scientific article; zbMATH DE number 956827
• Mathematics of Program Construction

Cited in

(29)

• Relational algebraic semantics of deterministic and nondeterministic programs
• A view of programming languages as symbiosis of meaning and computations
• An algebraic framework for minimum spanning tree problems
• Monomorphic characterization of n-ary direct products
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Certified semantics for relational programming
• Weak \(n\)-ary relational products in allegories
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Relational semantics revisited
• Semantic determinism and functional logic program properties
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• scientific article; zbMATH DE number 4193139 (Why is no real title available?)
• A Relation Algebraic Semantics for a Lazy Functional Logic Language
• Lazy Relations
• Relational Semantics for Higher-Order Programs
• A relational semantics for parallelism and non-determinism in a functional setting
• scientific article; zbMATH DE number 1975420 (Why is no real title available?)
• scientific article; zbMATH DE number 2087343 (Why is no real title available?)
• scientific article; zbMATH DE number 2090024 (Why is no real title available?)
• scientific article; zbMATH DE number 890353 (Why is no real title available?)
• Typed Relational Conversion
• The \theta -Join as a Join with \theta
• Stone relation algebras
• Mathematics of Program Construction
• Fast and loose reasoning is morally correct
• Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
• scientific article; zbMATH DE number 956827 (Why is no real title available?)
• Imperative abstractions for functional actions
• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362882)