Am Freitag, 22. Juni 2007, um 17:15 Uhr c.t. spricht
im Hörsaal B 051 über das Thema
Applications of domain theory to termination problems
Zusammenfassung: The fundamental ideas of domain theory are rooted in the work of Turing, Kleene and Kreisel on real number and higher type computability and were developed into an abstract mathematical theory of partial orders and topological spaces by Scott and Ershov providing models for the lambda calculus and modern programming languages. Domains are also the semantical basis for Helmut Schwichtenberg's pioneering work on interactive theorem proving and program extraction from proofs within the Minlog proof system. In the talk I will highlight some new applications of domain theory to the solution of hard termination problems originating in proof-theoretic questions.
Alle Interessierten sind hiermit herzlich eingeladen.