N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Basic Category Theory for Models of Syntax - Crole (2002) (2 citations) (Correct)
....the presheaf models described in these notes. For material on implementation, see [4, 5] A more recent approach, which combines de Bruijn notation and ordinary calculus in a hybrid syntax, is described in [1] If you are interested in direct implementations of equivalence, see [8, 9] See [3] for the origins of de Bruijn notation. The equation E = V E (E E) is a very simple example of a domain equation. Such equations arise frequently in the study of the semantics of programming languages. They do not always have solutions in Set . However, many can be solved in other ....
N. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998) (1 citation) (Correct)
....domain operations, such as abstractions, function applications or the fix operator. A letter class must be defined for bottom elements. Furthermore, a letter class must be defined for the implementation of function parameters. For this purpose De Bruijn indices are used instead of named dummies [dBru72]. De Bruijn indices facilitate the definition and implementation of textual substitution. Of the aforementioned letter classes, AbstractionImpl can be defined as: class AbstractionImpl: public ElementImpl RTTI SIGNATURE(ElementImpl, AbstractionImpl ) private: ElementImpl const ....
N. G. de Bruijn, "Lambda-Calculus Notation with Nameless Dummies: A Tool for Automatic Formula Manipulation", Indagationes Mathematicae, vol. 34, pp. 381--392, 1972.
Accomplishments and Research Challenges in Meta-Programming - Sheard (2000) (16 citations) (Correct)
....introduces several language constructs for correctly manipulating such terms, and a type system that ensures that one is indeed manipulating c equivalence classes. Intuitively, their approach resembles a nameful version of the well known nameless de Bruijn style of representing binding constructs[21]. The main advantage for the programmer is that the burden of reasoning about (as well as complicated algorithmic interface to) nameless terms is cast into a more user friendly setting. We shall present an example of such a language (with slightly modified syntax from [63] to demonstrate the ....
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381-392, 1972.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) (Correct)
....systems embedding a higher order term language, such as the logic programming languages Elf [Pfe94] and Prolog [Mil89, Mil01] typically represented terms in a way that mimics the traditional definition of a calculus. Ignoring common orthogonal optimizations such as the use of De Bruijn indices [dB72] or explicit substitutions [ACCL91] the above term is parsed and encoded as ( f a) b) c) During unification, three applications (here represented as juxtaposition) must be traversed before accessing its head, possibly just to discover that it differs from the head of the term being unified. ....
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972. 31
A Full Formalisation of π-Calculus Theory in the Calculus of .. - Hirschkoff (1997) (1 citation) (Correct)
....are described in Section 3. 2. 2 The de Bruijn Notation for Names Processes For the task of our Coq implementation, we represent the basic notion of calculus syntax, that is names, with a de Bruijn notation (following the ideas of [Hue93] In the de Bruijn representation (which is defined in [dB72]; a description of a de Bruijn notation for monadic calculus can be found in [Amb91] a name is defined by a natural number indicating its binding depth inside the term where it occurs, i.e. the number of binding operators that have to be crossed to reach the operator it refers to. Let us give ....
N.G. de Bruijn. Lambda Calculus Notation with Nameless Dummies: a Tool for Automatic Formula Manipulation, with Application to the CurchRosser Theorem. In Indagationes Mathematicae, volume 34, pages 381--392. 1972.
Types for Modules - Russo (1998) (3 citations) (Correct)
....of i. We will formalise this mechanism in Section 6.5. Example 6.4.2. The signature in Figure 6.3 exploits an indexed reference to fully specify the problematic type of the structure expression Y in Figure 6.1. Our technique is essentially a combination of named identifiers and de Bruijn [17] indices. Although terms written in pure de Bruijn notation are notoriously di#cult for humans to read, our scheme seems more acceptable in realistic programming situations. First, we need only use an index when we need to refer to an eclipsed identifier (this rarely occurs in practice and can ....
N. G. deBruijn. Lambda calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Mathematics, 34, 1972.
A Proof of the Church-Rosser Theorem - And Its Representation (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Linear Spine Calculus - Cervesato, Pfenning (2001) (1 citation) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972. 31
A Linear Spine Calculus - Iliano Cervesato Advanced (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
Refinement Types for ML - Freeman (1994) (54 citations) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
Replace This - Le With Prentcsmacro (2006) (Correct)
No context found.
de Bruijn, N., Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem, Indag. Math. 34 (1972), pp. 381-392.
A Linear Spine Calculus - Iliano Cervesato Advanced (2003) (1 citation) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Meta Logical Framework Based on Realizability - Schürmann (2000) (Correct)
No context found.
N.G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972. 15
A Linear Spine Calculus - Iliano Cervesato And (2003) (1 citation) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
Certified Higher-Order Recursive Path Ordering Adam Koprowski - Eindhoven University Of (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Formalization of the Simply Typed Lambda - Calculus In Coq (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Meta Logical Framework Based on Realizability - Schürmann (Correct)
No context found.
N.G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972. 15
A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992) (21 citations) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
Amalgams: Names and Name Capture in a Declarative Framework - Michel, Giavitto (1998) (Correct)
No context found.
de Bruijn, N. G. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 5 (1972), 381392.
An Interactive Proof System for Map Theory - Skalberg (2002) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae, 34(5):381-392, 1972. Reprinted in [NGdV94], pp. 375-388.
Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetà (1999) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) (Correct)
No context found.
N. G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381--392, 1972.
Weak and Strong Normalization, K-redexes, and First-Order Logic - Neergaard (1999) (Correct)
No context found.
N. G. de Bruijn. Lambda calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Math., 34(5):381--392, 1972. Reprinted in [NGdV94]. Cited on page 4.
Binding Logic: proofs and models - Dowek, Hardin, Kirchner (Correct)
No context found.
N.G. de Bruijn, Lambda calculus notation with nameless dummies: a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indag. Math. 34, pp 381-392.
Mechanized Operational Semantics via (Co)Induction - Simon Ambler And (Correct)
No context found.
N. de Bruijn. Lambda Calculus Notation with Nameless Dummies: a Tool for Automatic Formula Manipulation, with Application to the Church Rosser Theorem. Indagationes Mathematicae, 34:381-391, 1972.
First 50 documents
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