Non-dependant PTS's

• To: types@dcs.gla.ac.uk
• Subject: Non-dependant PTS's
• From: Neil Ghani <Neil.Ghani@ens.fr>
• Date: Mon, 18 Mar 96 11:24:37 MET
• Approved: types@dcs.gla.ac.uk

[------ The Types Forum ------- http://www.dcs.gla.ac.uk/~types ------]

Has there been any work on generalising the translation of the
Calculus of Constructions into Fw to a more abstract setting. Say for
instance where one has a notion of what a "non-dependant" PTS is and
then for every PTS one selects a (as large as possible) non-dependant
sub-PTS and shows that a translation exists.

Thanks in advance


-- 
Neil Ghani 

Tel	+33 1 44 32 32 77
Email	ghani@ens.fr
Webress	http://www.ens.fr/~ghani 
Address ENS, 45 Rue D'Ulm, 75230 Paris Cedex 05, France

• Prev: Re: On Weak and Strong Normalizations
• Next: Paper available: Linear Logic complements Classical Logic
• Index(es):
  • Main
  • Thread