Paula Severi  Home/Search
Context
Related
| win.tue.nl:8080/cs/csr/csr95...95.05.ps win.tue.nl/pub/techreports/...ptsw.ps.Z win.tue.nl/cs/csr/csr95/95.05.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: win.tue.nl:8080/cs/csr/csr95 (more) From: win.tue.nl/cs/csr/csr95 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we define the notion of pure type systems without the \Pi-condition. The \Pi-condition is the requirement that the type of an abstraction is typable. A pure type system without the \Pi-condition can be considered as an extension of the corresponding pure type system. We prove, besides studying the general properties of these systems, that weak normalisation is preserved by the extension. Using these systems, we define a syntax directed set of rules for singly sorted pure type... (Update)
Similar documents (at the sentence level):
42.1%: Normalisation in Lambda Calculus and its relation to Type Inference - Severi (1996) (Correct)
Active bibliography (related documents): More All
0.5: Pure Type Systems with Definitions - Severi, Poll (1993) (Correct)
0.5: Semantical Analysis of Perpetual Strategies in λ-calculus - Honsell, Lenisa (1998) (Correct)
0.2: Pure Type Systems in Rewriting Logic - Stehr, Meseguer (1999) (Correct)
Similar documents based on text: More All
0.2: A Module Calculus for Pure Type Systems - Courant (1997) (Correct)
0.1: Alpha Conversion in Simply Typed Lambda Calculus - Bove, SEVERI (Correct)
0.1: On Normalisation - van Raamsdonk, Severi (Correct)
BibTeX entry: (Update)
@misc{ severi-pure,
author = "Paula Severi",
title = "Pure Type Systems without the Π-condition",
url = "citeseer.ist.psu.edu/severi95pure.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
68 Logics and Type Systems - Geuvers - 1993
57 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
39 A modular proof of strong normalization for the calculus of .. (context) - Geuvers, Nederhof - 1991
24 Een nadere bewijstheoretische analyse van GSTT's (context) - Terlouw - 1989
19 Confluence and superdevelopment (context) - Van Raamsdonk - 1993
18 Towards a mathematical analysis of the coquand-huet calculus.. (context) - Berardi - 1988
10 Checking algorithms for pure type systems - Jutting, McKinna et al. - 1993
2 Centre for Mathematics and Computer Science Amsterdam (context) - Klop, systems et al. - 1990
2 CWI-Amsterdam and TU-Eindhoven (context) - Van Raamsdonk, Severi et al. - 1995
Documents on the same site (http://www.win.tue.nl:8080/cs/csr/csr95.html): More
Empty Interworkings and Refinement: Semantics of Interworkings .. - Mauw, Reniers (1995) (Correct)
Axiomatizing Early and Late Input by Variable Elimination - van Deursen (1995) (Correct)
Specification of Tools for Message Sequence Charts - Mauw, van der Meulen (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC