Stem bruijn$ (all stems)

14 papers:

LATA-2015-CazauxLR #assembly #graph

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (BC, TL, ER), pp. 109–120.

PADL-2015-Tarau #combinator #generative #logic programming #normalisation #on the #type inference

On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.

AFL-J-2011-KariX12 #revisited #sequence

De Bruijn Sequences Revisited (LK, ZX), pp. 1307–1322.

ICALP-v2-2012-Dowek #independence

A Theory Independent Curry-De Bruijn-Howard Correspondence (GD), pp. 13–15.

AFL-2011-KariX #revisited #sequence

De Bruijn Sequences Revisited (LK, ZX), pp. 241–254.

DAC-2008-MoussaBJ #flexibility #multi #network

Binary de Bruijn on-chip network for a flexible multiprocessor LDPC decoder (HM, AB, MJ), pp. 429–434.

DATE-2008-HosseinabadyKMP #architecture #energy #graph #latency #performance #scalability

De Bruijn Graph as a Low Latency Scalable Architecture for Energy Efficient Massive NoCs (MH, MRK, JM, DKP), pp. 1370–1373.

ICFP-2006-HickeyNYK #hybrid #representation #using

Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection (JH, AN, XY, AK), pp. 172–183.

ICPR-v4-2004-PagesSF

A New Optimised De Bruijn Coding Strategy for Structured Light Patterns (JP, JS, JF), pp. 284–287.

PPDP-2001-KamareddineBN #equivalence #syntax

De Bruijn’s Syntax and Reductional Equivalence of λ-Terms (FK, RB, RN), pp. 16–27.

RTA-2000-BonelliKR #higher-order

A de Bruijn Notation for Higher-Order Rewriting (EB, DK, AR), pp. 62–79.

CSL-1999-Bonelli #using

Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting (EB), pp. 204–219.

PLILP-1995-KamareddineR #λ-calculus

A λ-calculus à la de Bruijn with Explicit Substitutions (FK, AR), pp. 45–62.

RTA-1995-LescanneR

Explicit Substitutions with de Bruijn’s Levels (PL, JRD), pp. 294–308.