Eike Ritter, Valeria de Paiva  Home/Search
Context
Related
| cs.bham.ac.uk/pub/autho...icalp97.ps.gz 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: fermivista.math...p.cs.bham.ac.uk (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Eike Ritter and Valeria de Paiva ? School of Computer Science, University of Birmingham Abstract. Calculi with explicit substitutions have found widespread acceptance as a basis for abstract machines for functional languages. In this paper we investigate the relations between variants with de Bruijnnumbers, with variable names, with reduction based on raw expressions and calculi with equational judgements. We show the equivalence between these variants, which is crucial in establishing the... (Update)
Similar documents (at the sentence level):
77.8%: On Explicit Substitutions and Names - Ritter, de Paiva (1997) (Correct)
Active bibliography (related documents): More All
0.5: Why and How We Teach Evolutionary Computation at Birmingham - Riccardo Poli School (1999) (Correct)
0.4: Dependent Types and Explicit Substitutions - Muñoz (1999) (Correct)
0.3: Proof-Term Synthesis on Dependent-type Systems via Explicit.. - Muñoz (1999) (Correct)
Similar documents based on text: More All
0.9: Linear Explicit Substitutions - Ghani, De Paiva (1998) (Correct)
0.3: Explicit Substitutions for Linear Logical Frameworks.. - Cervesato, de Paiva.. (1999) (Correct)
0.2: Categorical Models for Intuitionistic and Linear Type Theory - Maietti, de Paiva, Ritter (2000) (Correct)
BibTeX entry: (Update)
@misc{ ritter-explicit,
author = "Eike Ritter and Valeria de Paiva",
title = "On Explicit Substitutions and Names (Extended Abstract)",
url = "citeseer.ist.psu.edu/124644.html" }
Citations (may not include all citations):236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
137 Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
68 Logics and Type Systems - Geuvers - 1993
68 Confluence properties of weak and strong calculi of explicit.. - Curien, Hardin et al. - 1996
29 Correctness and Completeness of a Categorical Semantics of t.. (context) - Streicher - 1989
23 From semantics to rules: A machine assisted analysis - Coquand - 1994
23 Typed -calculi with explicit substitution may not terminate (context) - Mellies - 1995
18 From oe to AE: a journey through calculi of explicit substit.. (context) - Lescanne - 1994
17 Formulation of Martin-Lof's theory types with explicit subst.. (context) - Tasistro - 1993
11 Confluence results for the pure strong categorical logic CCL (context) - Hardin - 1989
5 Preesrvation of strong normalisation in named lambda calculi.. (context) - Bloo, Rose - 1995
5 Normalization for typed lambda calculi with explicit substit.. - Ritter - 1994
3 An abstract framework for environment machines (context) - Curien - 1991
3 A lambda-calculus a la de bruijn with explicit substitutions (context) - Kamareddine, Rios - 1995
2 School of Computer Science (context) - Ritter, de Paiva et al. - 1997
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.bham.ac.uk.html): More
Using Data Structures within Genetic Programming - Langdon (Correct)
Laws of Generalized Prioritization (Extended Abstract) - Ryan, Schobbens (1993) (Correct)
A Review of Theoretical and Experimental Results on Schemata.. - Poli, Langdon (1997) (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