A confluent relational calculus for higher-order programming with constraints

DOI10.1007/BFB0016846MaRDI QIDQ5096302zbMATH OpenFDO

Authors Joachim Niehren, Gert Smolka

Publication date 16 August 2022

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

Full work available at URL https://doi.org/10.1007/BFB0016846

Mathematics Subject Classification ID

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

Recommendations

• A \(\rho\)-calculus of explicit constraint application
• A foundation for higher-order concurrent constraint programming
• scientific article; zbMATH DE number 1088220
• Combining higher-order and first-order computation using -calculus: Towards a semantics of ELAN
• A \(\rho\)-calculus of explicit constraint application

Cites work

• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 1088220 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1995172 (Why is no real title available?)

Cited in

(9)

• Conservativity of nested relational calculi with internal generic functions
• A confluent calculus for concurrent constraint programming
• Alloy*: a general-purpose higher-order relational constraint solver
• Models and emerging trends of concurrent constraint programming
• Expressing quantification in relational calculus by participation constraints
• A \(\rho\)-calculus of explicit constraint application
• scientific article; zbMATH DE number 1088220 (Why is no real title available?)
• A foundation for higher-order concurrent constraint programming
• On proving confluence modulo equivalence for Constraint Handling Rules

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

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