A polymorphic type system for Prolog

DOI10.1016/0004-3702(84)90017-1zbMATH Open0543.68076OpenAlexW2038037493WikidataQ56059065 ScholiaQ56059065MaRDI QIDQ796313FDOQ796313

Authors: Alan Mycroft, Richard A. O'Keefe 

Publication date: 1984

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(84)90017-1

Recommendations

• scientific article; zbMATH DE number 1497824
• A gradual polymorphic type system with subtyping for Prolog
• Towards Typed Prolog
• Logic programs with polymorphic types: A condition for static type checking
• scientific article; zbMATH DE number 1696599

zbMATH Keywords

polymorphic type scheme for Prologtype declarationstype resolution problem

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• A theory of type polymorphism in programming
• Title not available (Why is that?)
• Contributions to the Theory of Logic Programming
• A polymorphic type system for Prolog

Cited In (45)

• Title not available (Why is that?)
• A polymorphic type system for Prolog
• Title not available (Why is that?)
• Automatic Generation of Test Inputs for Mercury
• From Monomorphic to Polymorphic Well-Typings and Beyond
• Legality concepts for three-valued logic programs
• A new framework for declarative programming
• Improving precision of type analysis using non-discriminative union
• Logic programs with equational type specifications
• Logic programming with external procedures: Introducing S-unification
• Title not available (Why is that?)
• Towards a Type Discipline for Answer Set Programming
• Horn clause programs with polymorphic types: Semantics and resolution
• Static type checking for the Q functional language in Prolog
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Evolution of rule-based programs
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• HM(X) type inference is CLP(X) solving
• Title not available (Why is that?)
• Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages
• Indexed types
• Towards a Normal Form for Mercury Programs
• A gradual polymorphic type system with subtyping for Prolog
• Title not available (Why is that?)
• Recent Advances in Constraints
• VeriFly: On-the-fly Assertion Checking via Incrementality
• Specification and correctness proof of a WAM extension with abstract type constraints
• Refinement of a typed WAM extension by polymorphic order-sorted types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polymorphic success types for Erlang
• Extending constructive logic negation with types
• Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types
• Fifty Years of Prolog and Beyond
• Logic programs with polymorphic types: A condition for static type checking
• Title not available (Why is that?)
• A typed functional extension of logic programming
• Coding guidelines for Prolog
• Data type inference for logic programming
• Type inference for mobile ambients in Prolog
• Title not available (Why is that?)
• Towards Typed Prolog
• Typed SLD-resolution: dynamic typing for logic programming
• Implementing polymorphic typing in a logic programming language
• Reusing and modifying rulebases by predicate substitution

Uses Software

• ML

This page was built for publication: A polymorphic type system for Prolog

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