**This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.**

### Abstract

This theory provides functions for finding the index of an element in a list, by predicate and by value.

### License

### Topics

### Session List-Index

### Used by

- Making Arbitrary Relational Calculus Queries Safe-Range
- Fisher’s Inequality: Linear Algebraic Proof Techniques for Combinatorics
- Gale-Shapley Algorithm
- A data flow analysis algorithm for computing dominators
- Isabelle’s Metalogic: Formalization and Proof Checker
- JinjaDCI: a Java semantics with dynamic class initialization
- Verified SAT-Based AI Planning
- A verified algorithm for computing the Smith normal form of a matrix
- An Algebra for Higher-Order Terms
- Lower bound on comparison-based sorting algorithms
- The number of comparisons in QuickSort
- Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals
- The Imperative Refinement Framework
- Randomised Social Choice Theory
- Analysis of List Update Algorithms
- Planarity Certificates
- Converting Linear Temporal Logic to Deterministic (Generalized) Rabin Automata
- Derivatives of Logical Formulas
- Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions
- Affine Arithmetic
- Ordinary Differential Equations
- Jinja is not Java