Add to ORKGtechnical reportThis thesis develops a polymorphic, hierarchical type system for Prolog that can be checked statically. Type issues unique to Prolog, such as moding and treatment of logical variables, are considered. A type checking specification is defined and an algorithm fulfilling that specification is presented. Finally, the thesis describes the results of adding an implementation of this algorithm to an existing Prolog interpreter
Abstract. Prolog is traditionally not statically typed. Since the benefits of static typing are huge...
Mycroft and O'Keefe [25] presented a declaration-based type system for Pro-log. However, they d...
AbstractType analysis of Prolog is of primary importance for high-performance compilers since type i...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
Although Prolog was designed and developed as an untyped language, there have been numerous attempts...
AbstractApproaches to typing logic programs often exclude various features of Standard Prolog. The s...
Abstract Pure logic programming lacks some features known from other modern programming languages, e...
Abstract. Subtyping tends to undermine the eects of parametric poly-morphism as far as the static de...
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was d...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Type analysis of Prolog is of primary importance for high-performance compilers, since type informat...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
Abstract. Prolog is traditionally not statically typed. Since the benefits of static typing are huge...
Mycroft and O'Keefe [25] presented a declaration-based type system for Pro-log. However, they d...
AbstractType analysis of Prolog is of primary importance for high-performance compilers since type i...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
Although Prolog was designed and developed as an untyped language, there have been numerous attempts...
AbstractApproaches to typing logic programs often exclude various features of Standard Prolog. The s...
Abstract Pure logic programming lacks some features known from other modern programming languages, e...
Abstract. Subtyping tends to undermine the eects of parametric poly-morphism as far as the static de...
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was d...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Type analysis of Prolog is of primary importance for high-performance compilers, since type informat...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
Abstract. Prolog is traditionally not statically typed. Since the benefits of static typing are huge...
Mycroft and O'Keefe [25] presented a declaration-based type system for Pro-log. However, they d...
AbstractType analysis of Prolog is of primary importance for high-performance compilers since type i...