Constraint handling rules with binders, patterns and generic quantification

DOI10.1017/S1471068417000230zbMath1422.68030arXiv1707.02754OpenAlexW2963253479MaRDI QIDQ4592722

Alejandro Serrano, Jurriaan Hage

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02754

zbMATH Keywords

constraint handling rulespattern unificationgeneric quantification

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Uses Software

• Abella

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unification algorithm for typed \(\bar\lambda\)-calculus
• The locally nameless representation
• Programming languages and systems. 4th Asian symposium, APLAS 2006, Sydney, Australia, November 8--10, 2006. Proceedings
• Visible Type Application
• As time goes by: Constraint Handling Rules
• Practical type inference for arbitrary-rank types
• Understanding functional dependencies via constraint handling rules
• A Framework for Extended Algebraic Data Types
• Observable Confluence for Constraint Handling Rules
• Constraint Handling Rules
• Theory and practice of constraint handling rules
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
• Linear unification of higher-order patterns
• A logic programming language with lambda-abstraction, function variables, and simple unification
• Abella: A System for Reasoning about Relational Specifications
• Complete and easy bidirectional typechecking for higher-rank polymorphism
• FreshML
• A proof theory for generic judgments
• Logic Programming
• Termination Analysis of CHR Revisited

This page was built for publication: Constraint handling rules with binders, patterns and generic quantification