In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Previous work on discourse parsing has mostly relied on surface syntactic and lexical features; the use of semantics is limited to shallow semantics. The goal of this thesis is to...
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...