Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
The last decade of basic research in the area of Description Logics (DL) has created a stable theory, efficient inference procedures, and has demonstrated a wide applicability of ...
This paper studies sorted generalization-the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorith...