Unifying sets and programs via dependent types

Annals of Pure and Applied Logic 163 (7):789-808 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A new symbolic representation for the algebra of sets.Jerome Frazee - 1990 - History and Philosophy of Logic 11 (1):67-75.
Syntactic calculus with dependent types.Aarne Ranta - 1998 - Journal of Logic, Language and Information 7 (4):413-431.
On generically stable types in dependent theories.Alexander Usvyatsov - 2009 - Journal of Symbolic Logic 74 (1):216-250.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
On uniform definability of types over finite sets.Vincent Guingona - 2012 - Journal of Symbolic Logic 77 (2):499-514.
In defence of object-dependent thoughts.Sean Crawford - 1998 - Proceedings of the Aristotelian Society 98 (2):201-210.

Analytics

Added to PP
2013-10-27

Downloads
13 (#1,010,467)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Some properties of intuitionistic Zermelo-Frankel set theory.John Myhill - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 206--231.
A Framework for Defining Logics.Robert Harper, Furio Honsell & G. Plotkin - 1991 - LFCS, Department of Computer Science, University of Edinburgh.

View all 6 references / Add more references