Towards a Simply Typed CALculus for Semantic Knowledge Bases

16 pages•Published: May 15, 2012

Abstract

This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed $\lambda$-calculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of semantic information for programming with data whose structure is organised under a relational data model. The cALculus arises from a natural interpretation of the tableau rules for constructive ALC following the Curry-Howard-Isomorphism.

Keyphrases: constructive description logic, curry howard isomorphism, modal type theory, simply typed lambda calculus

In: Berndt Müller (editor). LAM'10. 3rd International Workshop on Logics, Agents, and Mobility, vol 7, pages 52-67.

Links:	https://easychair.org/publications/paper/Kh
	https://doi.org/10.29007/xlfw

BibTeX entry

@inproceedings{LAM'10:Towards_Simply_Typed_CALculus,
  author    = {Michael Mendler and Stephan Scheele},
  title     = {Towards a Simply Typed CALculus for Semantic Knowledge Bases},
  booktitle = {LAM'10. 3rd International Workshop on Logics, Agents, and Mobility},
  editor    = {Berndt Müller},
  series    = {EPiC Series in Computing},
  volume    = {7},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Kh},
  doi       = {10.29007/xlfw},
  pages     = {52-67},
  year      = {2012}}

Download PDF Open PDF in browser