A polymorphic type system for PROLOG.
Artificial Intelligence
The Go¨del programming language
The Go¨del programming language
A practical type analysis for verification of modular prolog programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Information Sciences: an International Journal
Cedalion: a language for language oriented programming
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
On the implementation of the CLP(BN) language
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Theory and Practice of Logic Programming - Prolog Systems
An overview of ciao and its design philosophy
Theory and Practice of Logic Programming - Prolog Systems
Real-Time persistent queues and deques with logic variables (declarative pearl)
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Modular extensions for modular (logic) languages
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was decided to grow a portable type system inside two widely used open source Prolog systems: SWI-Prolog and Yap. This requires close cooperation and agreement between the two systems. The type system is Hindley-Milner. The main characteristics of the introduction of types in SWI and Yap are that typing is not mandatory, that typed and untyped code can be mixed, and that the type checker can insert dynamic type checks at the boundaries between typed and untyped code. The basic decisions and the current status of the Typed Prolog project are described, as well as the remaining tasks and problems to be solved.