Typing a lambda calculus using DL[go to overview]
Despite a number of frameworks, programming with Description Logics is still challenging in unique ways. Part of the problem are static type systems, that are supposed to prevent runtime errors. Roughly speaking, two problems can be identified: (1) Concept descriptions are problematic to map into these systems and (2) inferencing is not considered during typing. In this talk, we will examine how a simply typed lambda calculus could use individuals and concepts of a DL knowledge base and how such programs could be type-checked.
18.02.16 - 10:15