A confluent relational calculus for higher-order programming with constraints

DOI10.1007/BFb0016846zbMath1495.68043MaRDI QIDQ5096302

Joachim Niehren, Gert Smolka

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

A confluent calculus for concurrent constraint programming ⋮ On proving confluence modulo equivalence for Constraint Handling Rules ⋮ Models and emerging trends of concurrent constraint programming

Cites Work

• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A confluent relational calculus for higher-order programming with constraints