The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
This paper investigates a method to represent database objects as typed expressions in programming languages. A simple typed language supporting non-flat records, higher-order rel...
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
Background: For effective exposition of biological information, especially with regard to analysis of large-scale data types, researchers need immediate access to multiple categor...
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...