Nov 16, 2007 · Abstract: ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF ...

Using set terms, we axiomatize IZF with Replacement, which we call IZF R , along with its intensional counterpart IZF . We define a typed lambda calculus λZ ...

We use normalization to prove disjunction, numerical existence, set existence and term existence properties. An inner extensional model is used to show the ...

Apr 8, 2008 · Normalization proofs, based on the Curry-Howard isomorphism principle, have the advantage of providing an explicit method of witness and program ...

we show weak normalization of λZ by employing a reduction-preserving erasure map from lambda terms to realizers. We use normalization to prove disjunction, ...

This work axiomatizes IZF with Replacement, which is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory, and shows weak ...

Normalization proofs, based on Curry-Howard isomorphism, have the advantage of providing an explicit method of witness and program extraction from the proofs.

Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda calculus \li ...

Sep 25, 2006 · We use normalization to prove disjunction, numerical existence, set existence and term existence properties. An inner extensional model is used ...

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...