CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

A generic normalisation proof for pure type systems

by: Paul-André Melliès, Benjamin Werner
Types for Proofs and Programs (1998), pp. 254-276, doi:10.1007/bfb0097796  Key: citeulike:5251122

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We prove the strong normalisation for any PTS, provided the existence of a certain Λ-set $$\mathfrakA^ \Uparrow $$ (s) for every sort s of the system. The properties verified by the $$\mathfrakA^ \Uparrow $$ (s)’s depend of the axiom and rules of the type system.


ConcertRG's tags for this article

Citations (CiTO)

No CiTO relationships defined

Xnote Notes for this article (1 public)


X There are no reviews yet

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.