Typing constraint logic programs

DOI10.1017/S1471068401001120zbMATH Open1066.68514OpenAlexW2033405134MaRDI QIDQ4452649FDOQ4452649

Authors: François Fages, Emmanuel Coquery 

Publication date: 1 March 2004

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

Full work available at URL: https://doi.org/10.1017/s1471068401001120

Recommendations

• Publication:4944893
• scientific article; zbMATH DE number 1696599
• A type system for logic programs
• On types and type consistency in logic programming (Diss., FernUniv. Hagen, 1999)
• Recent Advances in Constraints

zbMATH Keywords

subtypingtype checking ISO-Prolog

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (12)

• Title not available (Why is that?)
• Improving precision of type analysis using non-discriminative union
• Static type checking for the Q functional language in Prolog
• Static type inference for the Q language using constraint logic programming
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• From Rules to Constraint Programs with the Rules2CP Modelling Language
• Abstract interpretation and types for systems biology
• Title not available (Why is that?)
• Coding guidelines for Prolog
• Checking modes of HAL programs

This page was built for publication: Typing constraint logic programs

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