Gopalan Nadathur  Home/Search
Context Related
| duke.edu/pub/dist/techre...199401.ps.Z 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: duke.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Issues that are relevant to the representation of lambda terms in contexts where their intensions have to be manipulated are examined. The basis for such a representation is provided by the suspension notation for lambda terms that is described in a companion paper. This notation obviates ff-conversion in the comparison of terms by using the `nameless' scheme of de Bruijn and also permits a delaying of substitutions by including a class of terms that encode other terms together with... (Update)
Context of citations to this paper: More
...environment must themselves be incremented by one. The problems described above can be overcome by using the notation developed in [33, 34, 35], and we use this notation in our implementation. The main novelty of this notation is the addition of a new category to terms that...
...by Lemma 8.4. 2 Several other observations can be made of the overall rewrite system and this is, in fact, done in a companion paper [Nad94] where we consider refinements to and applications of the rewrite system presented here. The present observations are of interest...
Cited by: More
Unification via Explicit Substitutions: - The Case Of (Correct)
Scalable Certification of Native Code: Experience from.. - Grossman, Morrisett (2000) (Correct)
A Type System for Coordinated Data Structures - Ringenburg, Grossman (2004) (Correct)
Similar documents (at the sentence level):
38.5%: A Fine-Grained Notation for Lambda Terms and Its Use in.. - Nadathur (1996) (Correct)
8.0%: A Notation for Lambda Terms I: A Generalization of Environments - Nadathur, Wilson (1994) (Correct)
5.8%: A Notation for Lambda Terms: A Generalization of Environments - Nadathur, Wilson (1994) (Correct)
Active bibliography (related documents): More All
0.3: Implementation Considerations for Higher-Order Features in.. - Nadathur, Wilson (1993) (Correct)
0.2: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1995) (Correct)
0.2: A Realization of Built-in Procedures in a - Prolog Implementation (Correct)
Similar documents based on text: More All
0.8: The Suspension Notation for Lambda Terms and its Use in.. - Nadathur (2003) (Correct)
0.5: A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003) (Correct)
0.5: Implementing Polymorphic Typing in a Logic Programming.. - Kwon, Nadathur, Wilson (1993) (Correct)
Related documents from co-citation: More All
7: A representation of lambda terms suitable for operations on their intensions (context) - Nadathur, Wilson - 1990
5: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
5: TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1995
BibTeX entry: (Update)
Gopalan Nadathur. A notation for lambda terms II: Refinements and applications. Technical Report CS-1994-01, Department of Computer Science, Duke University, January 1994. http://citeseer.ist.psu.edu/article/nadathur94notation.html More
@techreport{ nadathur94notation,
author = "Gopalan {Nadathur} and Debra Sue Wilson.",
title = "A Notation for Lambda Terms {II}: Refinements and Applications",
number = "Technical report DUKE--TR--1994--01",
year = "1994",
url = "citeseer.ist.psu.edu/article/nadathur94notation.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable, Allen et al. - 1986
434 A framework for defining logics - Harper, Honsell et al. - 1993
419 A formulation of the simple theory of types (context) - Church - 1940
266 Information and Computation (context) - Coquand, Huet et al. - 1988
174 A unification algorithm for typed -calculus (context) - Huet - 1975
172 Higher-order abstract syntax (context) - Pfenning, Elliot - 1988
166 An overview of Prolog (context) - Nadathur, Miller - 1988
157 Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
129 The foundations of a generic theorem prover - Paulson - 1988
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
106 The categorical abstract machine (context) - Cousineau, Curien et al. - 1987
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
96 A survey of the project AUTOMATH (context) - de Bruijn - 1980
71 Elf: A language for logic definition and verified metaprogra.. - Pfenning - 1989
65 Sequential Algorithms and Functional Programming (context) - Curien - 1986
47 A logic programming approach to manipulating formulas and pr.. - Miller, Nadathur - 1987
42 Resolution in type theory (context) - Andrews - 1971
42 On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990
38 A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990
32 A lazy evaluator (context) - Henderson, Morris - 1976
31 A notation for lambda terms I: A generalization of environme.. - Nadathur, Wilson - 1993
29 Incremental reduction in the lambda calculus (context) - Field, Teitelbaum - 1990
28 and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1990
16 Naive reverse can be linear - Brisset, Ridoux - 1991
16 Introduction to Combinatory Logic and Lambda Calculus (context) - Hindley, Seldin - 1986
15 Implementation considerations for higher-order features in l.. - Nadathur, Jayaraman et al. - 1993
12 The representation of logics in higher-order logic (context) - Paulson - 1987
7 An efficient interpreter for the lambda-calculus (context) - Aiello, Prini - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994) (Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (Correct)
Efficient Simulation of Action Potential Propagation in a Bidomain - Hooke (1992) (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