Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) A verified framework for higher-order uncurrying optimizations Zaynah Dargaye · Xavier Leroy

Source URL: pauillac.inria.fr

• Mathematics
• Functional programming
• Functions and mappings
• Currying
• Partial application
• Symbol
• Function
• Combinatory logic
• De Bruijn index
• Declarative programming
• Lambda calculus
• Software engineering

Ankie Verlaan - Güngör Uslu - Hüseyin Asma - Jacob van der Wel - Jan Anthonie Bruijn - Karin Straus - Kees van Bergen - Maurice Crul - Mirjam Bakker - Piet-Hein van de Ven - Pim Breebaart - Suzan van Dieren - Tamara v

Source URL: cosmicus.nl

Mutual trust Carel van Eykelenburg Annemarie Jorritsma Nico Oudhof Marc de Bruijn Caspar Boendermaker

Source URL: www.bngbank.nl

• Association of Netherlands Municipalities
• Bank
• Financial crisis
• Economics
• Netherlands
• Geography of the Netherlands
• Pijnacker
• Nootdorp

Evolutionary Construction of de Bruijn Sequences ∗ Meltem S¨ onmez Turan National Institute of Standards and Technology, Computer Security Division

Source URL: eprint.iacr.org

• De Bruijn sequence
• Travelling salesman problem
• Genetic algorithm
• De Bruijn
• Mutation
• Bruijn
• Koorde
• Mathematics
• Combinatorics
• Graph theory

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter University of Warsaw

Source URL: www.cs.ucr.edu

• Combinatorics on words
• Enumerative combinatorics
• Lyndon word
• De Bruijn sequence
• Sequence
• De Bruijn
• Combinatorics
• Mathematics
• Discrete mathematics

From Indexing Data Structures to de Bruijn Graphs Bastien Cazaux, Thierry Lecroq, Eric Rivals LIRMM & IBC, Montpellier - LITIS Rouen June 15, 2014

Source URL: www.cs.ucr.edu

• Suffix tree
• Generalised suffix tree
• De Bruijn
• Tree
• Graph
• Bruijn
• Graph theory
• Arrays
• Suffix array

Linear Cellular Automata via de Bruijn Diagrams Harold V. McIntosh Departamento de Aplicacion de Microcomputadoras, Instituto de Ciencias, Universidad Autonoma de Puebla, Apartado postal 461, 72000 Puebla, Puebla, Mex

Source URL: delta.cs.cinvestav.mx

• Graph operations
• Matroid theory
• Graph drawing
• Signed graph
• Graph theory
• Graph
• Directed graph

FreshML: A Fresh Approach to Name Binding in Metaprogramming Languages Final Report∗ Andrew M. Pitts February 2005 Abstract

Source URL: www.cl.cam.ac.uk

• Logic in computer science
• Models of computation
• Formal methods
• Denotational semantics
• De Bruijn index
• Higher-order abstract syntax
• Lambda calculus
• ECL programming language
• Actor model
• Computing
• Software engineering
• Theoretical computer science

LFMTPNominal Reasoning Techniques in Coq (Extended Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science

Source URL: www.seas.upenn.edu

• Lambda calculus
• Theory of computation
• Computability theory
• Functions and mappings
• Logic in computer science
• Combinatory logic
• Function
• Primitive recursive function
• De Bruijn index
• Mathematics
• Theoretical computer science
• Mathematical logic

Adaptive Operating System Design for High Throughput I/O Willem de Bruijn Vrije Universiteit Amsterdam

Source URL: www.cs.vu.nl

• Unix
• Kernel
• Throughput
• File system
• Cache
• Server
• Thread
• Operating system
• System software
• Computer architecture
• Computing