A type system for logic programs

DOI10.1016/0743-1066(91)80002-UzbMATH Open0717.68016MaRDI QIDQ5748874FDOQ5748874

Eyal Yardeni, Ehud Shapiro

Publication date: 1991

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Recommendations

• On types and type consistency in logic programming (Diss., FernUniv. Hagen, 1999)
• scientific article; zbMATH DE number 4026804
• Efficient run-time type checking of typed logic programs
• Logic programs with polymorphic types: A condition for static type checking
• scientific article; zbMATH DE number 5198991

zbMATH Keywords

type checkingtype system for logic programs

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17)

Cited In (35)

• Title not available (Why is that?)
• Improving precision of type analysis using non-discriminative union
• On types and type consistency in logic programming (Diss., FernUniv. Hagen, 1999)
• Typing constraint logic programs
• Title not available (Why is that?)
• Towards a Type Discipline for Answer Set Programming
• Horn clause programs with polymorphic types: Semantics and resolution
• Title not available (Why is that?)
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• Title not available (Why is that?)
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• A polymorphic type dependency analysis for logic programs
• The appropriateness of predicate invention as bias shift operation in ILP
• A sound and complete Hoare logic for dynamically-typed, object-oriented programs
• Title not available (Why is that?)
• Recent Advances in Constraints
• Title not available (Why is that?)
• Type inference in Prolog: A new approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient run-time type checking of typed logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-termination Analysis of Logic Programs Using Types
• Logic programs with polymorphic types: A condition for static type checking
• Data type inference for logic programming
• Automata, Languages and Programming
• Mints type deductive calculi for logic programming
• Title not available (Why is that?)
• Towards substructural property-based testing
• Typed SLD-resolution: dynamic typing for logic programming
• New results on type systems for functional logic programming
• Title not available (Why is that?)
• Bottom-up abstract interpretation of logic programs

This page was built for publication: A type system for logic programs

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