DLOG
2010
13 years 9 months ago
2010
A fragment of type theory with OWL class constructions for types and binary properties is used to formalize SysML Structural Block Diagram models. A structural SysML block diagram ...
MST
2007
13 years 11 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
BSL
2002
13 years 11 months ago
2002
Abstract. In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910
ENTCS
2007
13 years 11 months ago
2007
We describe how a set-theoretic foundation for mathematics can be encoded in the new system Scunak. We then discuss an encoding of the construction of functions as functional relat...
JAPLL
2006
13 years 11 months ago
2006
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
JAPLL
2006
13 years 11 months ago
2006
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
ENTCS
2006
13 years 11 months ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
ENTCS
2008
13 years 11 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
ENTCS
2008
13 years 11 months ago
2008
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...