Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,901 papers from all fields of science
Search
Sign In
Create Free Account
De Bruijn index
Known as:
Barendregt convention
, De Bruijn
, De Bruijn indices
De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming systems.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Automated theorem proving
Combinatory logic
De Bruijn notation
Explicit substitution
Expand
Broader (1)
Lambda calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem
C. Kaliszyk
,
H. Barendregt
Certified Programs and Proofs
2011
Corpus ID: 13025296
Nominal Isabelle is a framework for reasoning about programming languages with named bound variables (as opposed to de Bruijn…
Expand
2011
2011
3D scan of a color object using a color structured light pattern
S. Keerativittayanun
,
T. Kondo
,
P. Sira-uksorn
,
T. Phatrapornant
,
M. Sato
IEEE 7th International Colloquium on Signal…
2011
Corpus ID: 6538448
Colour structured light with spatial neighbourhood is one of the famous techniques that are used to acquire 3D information. By…
Expand
2011
2011
A Solution to the PoplMark Challenge Based on de Bruijn Indices
Jérôme Vouillon
Journal of automated reasoning
2011
Corpus ID: 20574991
The PoplMark challenge proposes a set of benchmarks intended to assess the usability of proof assistants in the context of…
Expand
2009
2009
Logic Colloquium 2006: Higher-order abstract syntax in type theory
Venanzio Capretta
,
A. Felty
2009
Corpus ID: 15277353
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool…
Expand
2007
2007
POPLmark Challenge Via de Bruijn Indices
Stefan Berghofer
Arch. Formal Proofs
2007
Corpus ID: 45490976
2006
2006
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
Venanzio Capretta
,
A. Felty
Types for Proofs and Programs
2006
Corpus ID: 1587543
The use of higher-order abstract syntax is an important approach for the representation of binding constructs in encodings of…
Expand
2005
2005
Coded light projection techniques for 3D reconstruction
J. Pagès
,
J. Salvi
2005
Corpus ID: 16254899
Coded structured light is a computer vision technique which aims to reconstruct objects. This kind of technique belongs to the…
Expand
2002
2002
On the superconnectivity of generalized p-cycles
C. Balbuena
,
I. Pelayo
,
J. Gómez
Discrete Mathematics
2002
Corpus ID: 17343691
2000
2000
A formalization of a concurrent object calculus up to α-conversion
G. Gillard
2000
Corpus ID: 17216908
We experiment a method for representing a concurrent object calculus in the Calculus of Inductive Constructions. Terms are first…
Expand
1999
1999
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
E. Bonelli
Annual Conference for Computer Science Logic
1999
Corpus ID: 40743368
We propose a calculus of explicit substitutions with de Bruijn indices for implementing objects and functions which is confluent…
Expand
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)
ACCEPT & CONTINUE