21 search results - page 2 / 5 » Refinement Types as Proof Irrelevance |
CPP
2011
12 years 5 months ago
2011
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
ENTCS
2008
13 years 5 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
SCP
2008
13 years 5 months ago
2008
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...