Many frameworks have been proposed for deriving specific runtime properties, but there is still a lack of knowledge about how they all fit together. To fill this gap, we discuss various kinds of type information and the relations between them, and sketch a method for obtaining the required information. This method is used as part of an system for automatic translation of Prolog programs into strongly typed languages such as PROTOS-L or G odel. 1 Introduction By deriving details about the types and modes of logic programs, it is possible to obtain useful information about such programs. This information can be used for various purposes, e.g.: ffl optimization of Prolog programs, ffl debugging support, ffl automatic translation of Prolog ...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Mycroft and O'Keefe [25] presented a declaration-based type system for Pro-log. However, they d...
AbstractThis paper presents a new approach to type inference of Prolog programs. The novelty is in t...
Abstract. Prolog is traditionally not statically typed. Since the benefits of static typing are huge...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
There have been many schemes for type inference for many languages. Logic pro-gramming provides its ...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was d...
Interpretation: Towards the Global Optimisation of PROLOG Programs", Proceedings 4 th IEEE Sy...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
Abstract. The traditional purpose of types in programming languages of providing correctness assuran...
AbstractThe so called “cogen approach” to program specialisation, writing a compiler generator inste...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Mycroft and O'Keefe [25] presented a declaration-based type system for Pro-log. However, they d...
AbstractThis paper presents a new approach to type inference of Prolog programs. The novelty is in t...
Abstract. Prolog is traditionally not statically typed. Since the benefits of static typing are huge...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
There have been many schemes for type inference for many languages. Logic pro-gramming provides its ...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was d...
Interpretation: Towards the Global Optimisation of PROLOG Programs", Proceedings 4 th IEEE Sy...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
Abstract. The traditional purpose of types in programming languages of providing correctness assuran...
AbstractThe so called “cogen approach” to program specialisation, writing a compiler generator inste...
A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) ...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...