Collections, sets and types

Authors:
Gilles Dowek
Affiliations:
INRIA-Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex, France. E-mail: Gilles.Dowek@inria.fr (http://coq.inria.fr/~dowek)
Venue:
Mathematical Structures in Computer Science
Year:
1999

Citing 2
Cited 1

An introduction to mathematical logic and type theory: to truth through proof

An introduction to mathematical logic and type theory: to truth through proof
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

IEEE Transactions on Software Engineering

Combining type theory and untyped set theory

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a formulation of simple type theory in which types are just sets. This theory is obtained by relativizing quantifiers and replacing typing predicates by membership of some sets. It can easily be extended to include predicate subtyping.