Skip to search formSkip to main contentSkip to account menu

De Bruijn notation

Known as: De Bruijn 
In mathematical logic, the De Bruijn notation is a syntax for terms in the λ calculus invented by the Dutch mathematician Nicolaas Govert de Bruijn… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Categorical abstract machineDe Bruijn indexExplicit substitutionPure type system

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
INTERSECTION TYPE SYSTEM AND LAMBDA CALCULUS WITH DIRECTOR STRINGS
The operation of substitution in 𝜆-calculus is treated as an atomic operation. It makes that substitution operation is complex… 
2012
2012
SIS-M: Web assist system to the choice of educational activities, with real time localization, for helping the inclusive education
In this paper we describe the outcome of the SIS-M project, consisting in the development of web support system for the teacher… 
2011
2011
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
2010
2010
Polynomial identification in uniform and operator algebras
Let A be a unital Banach algebra, and denote the spectral radius of f 2 A by (f). If A is a uniform algebra and (fh + 1) = (gh… 
2009
2009
Logic Colloquium 2006: Higher-order abstract syntax in type theory
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool… 
2008
2008
Intersection Type System with de Bruijn Indices
λ-calculus in de Bruijn notation is relevant because it avoids variable names using instead indices which makes it more adequate… 
2007
2007
Theorem Proving in Higher Order Logics, 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings
2006
2006
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
The use of higher-order abstract syntax is an important approach for the representation of binding constructs in encodings of… 
1995
1995
The S-calculus: Its Typed and Its Extended Versions
We present in this paper the simply typed version of the s-calculus (cf. KR95]) and prove the strong normalisation of the well… 
1993
1993
A study of the λ-calculus in de Bruijn's notation
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)