Sciweavers

1817 search results - page 8 / 364
» Forcing and Type Theory
Sort
View
PLDI
2010
ACM
14 years 4 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
ESOP
2008
Springer
13 years 9 months ago
A Realizability Model for Impredicative Hoare Type Theory
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
Rasmus Lerchedahl Petersen, Lars Birkedal, Aleksan...
BSL
2002
113views more  BSL 2002»
13 years 7 months ago
Types in logic and mathematics before 1940
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
Fairouz Kamareddine, Twan Laan, Rob Nederpelt
BSL
2008
95views more  BSL 2008»
13 years 7 months ago
Cohen and Set Theory
We discuss the work of Paul Cohen in set theory and its influence, especially the background, discovery, development of forcing. Paul Joseph Cohen (1934
Akihiro Kanamori
MKM
2007
Springer
14 years 1 months ago
Towards Constructive Homological Algebra in Type Theory
This paper reports on ongoing work on the project of representing the Kenzo system [15] in type theory [11].
Thierry Coquand, Arnaud Spiwack