Processing Language with Logical Types and Active Constraints

Abstract

In this document, we present a language which associates type construction principles to constraint logic programming. We show that it is very appropriate for language processing, providing more uniform, expressive and efficient tools and treatments. We introduce three kinds of constraints, that we exemplify by motivational examples. Finally, we give the procedural semantics of our language, combining type construction with SLDresolution.