The meeting will take place in Forum F - Campus de la Plaine. Click here to have an access map. This includes model-checking, theorem proving, abstract interpretation, partial evaluation, type checking, animation of formal descriptions, proof of programs, termination analysis, complexity and decidability issues , etc.
Registration is by email.
There are no registration fees. The usual playground for polymorphic type inference is that of functional programming languages, exemplified by the Hindley-Milner system as found in ML and Haskell. We describe an attempt to do polymorphic type inference for the relational algebra, the basic query language for relational databases. Iterating Transducers Regular languages have proved useful for the symbolic state exploration of infinite state systems. A standard problem encountered when doing symbolic state exploration for infinite state systems is how to explore all states in a finite amount of time.