A polymorphic type system for Prolog

DOI10.1016/0004-3702(84)90017-1MaRDI QIDQ796313zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

polymorphic type scheme for Prologtype declarationstype resolution problem

Mathematics Subject Classification ID

Theory of software (68N99)

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

Cites work

• scientific article; zbMATH DE number 3713199 (Why is no real title available?)
• A polymorphic type system for Prolog
• A theory of type polymorphism in programming
• Contributions to the Theory of Logic Programming

Cited in

(45)

• A polymorphic type system for Prolog
• scientific article; zbMATH DE number 4060764 (Why is no real title available?)
• Legality concepts for three-valued logic programs
• scientific article; zbMATH DE number 1942464 (Why is no real title available?)
• Automatic Generation of Test Inputs for Mercury
• From Monomorphic to Polymorphic Well-Typings and Beyond
• A new framework for declarative programming
• Logic programming with external procedures: Introducing S-unification
• Logic programs with equational type specifications
• Improving precision of type analysis using non-discriminative union
• Horn clause programs with polymorphic types: Semantics and resolution
• scientific article; zbMATH DE number 4092733 (Why is no real title available?)
• Towards a Type Discipline for Answer Set Programming
• Static type checking for the Q functional language in Prolog
• Evolution of rule-based programs
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Checking Emptiness of Non-Deterministic Regular Types with Set Operators
• scientific article; zbMATH DE number 1678377 (Why is no real title available?)
• HM(X) type inference is CLP(X) solving
• 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
• scientific article; zbMATH DE number 7453101 (Why is no real title available?)
• Recent Advances in Constraints
• Specification and correctness proof of a WAM extension with abstract type constraints
• Refinement of a typed WAM extension by polymorphic order-sorted types
• VeriFly: On-the-fly Assertion Checking via Incrementality
• scientific article; zbMATH DE number 7453099 (Why is no real title available?)
• scientific article; zbMATH DE number 67966 (Why is no real title available?)
• Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types
• Polymorphic success types for Erlang
• Extending constructive logic negation with types
• Fifty Years of Prolog and Beyond
• A typed functional extension of logic programming
• scientific article; zbMATH DE number 1696599 (Why is no real title available?)
• Logic programs with polymorphic types: A condition for static type checking
• Coding guidelines for Prolog
• Type inference for mobile ambients in Prolog
• Data type inference for logic programming
• scientific article; zbMATH DE number 3907754 (Why is no real title available?)
• Towards Typed Prolog
• Implementing polymorphic typing in a logic programming language
• Typed SLD-resolution: dynamic typing for logic programming
• Reusing and modifying rulebases by predicate substitution

Describes a project that uses

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)