User:Janlima/Books/Data Types
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
- Data type
- Abstract data type
- Enumerated type
- Currying
- Lazy evaluation
- Closure (computer programming)
- Smn theorem
- Closed monoidal category
- Exponential object
- First-class function
- Function space
- Boolean data type
- Integer (computer science)
- Floating point
- Fixed-point arithmetic
- Arbitrary-precision arithmetic
- Composite data type
- Array data type
- Array access analysis
- Array programming
- Array slicing
- Bounds checking
- Bounds-checking elimination
- Delimiter-separated values
- Comparison of programming languages (array)
- Parallel array
- Record (computer science)
- Variable-length array
- Dynamic array
- Sparse array
- Data structure
- Hash table
- Associative array
- Tuple
- Tagged union
- Set (abstract data type)
- Graph (abstract data type)
- Graph traversal
- Graph database
- Graph rewriting
- GraphStream
- Graphviz
- Tree (data structure)
- Tree structure
- Tree (graph theory)
- Tree (set theory)
- Hierarchy (mathematics)
- Dialog tree
- Multiple inheritance
- Day–Stout–Warren algorithm
- Enfilade (Xanadu)
- Left-child right-sibling binary tree
- Hierarchical temporal memory
- Pointer (computer programming)
- Sorting algorithm
- Search algorithm
- Plain old data structure
- Concurrent data structure
- Data model
- Dynamization
- Linked data structure
- Persistent data structure
- Linked list
- Type system
- Primitive data type
- Reference type
- Option type
- Nullable type
- Null Object pattern
- Sentinel value
- Algebraic data type
- Subtyping
- Inheritance (object-oriented programming)
- Object (computer science)
- Type variable
- Class (computer programming)
- Recursive data type
- Function type
- Universal quantification
- Existential quantification
- Modular programming
- Refinement (computing)
- Dependent type
- Comparison of type systems
- Covariance and contravariance (computer science)
- Operator overloading
- Polymorphism (computer science)
- Signedness
- Type rule
- Type signature
- Type theory
- Container (abstract data type)
- Double-ended queue
- List (abstract data type)
- Queue (abstract data type)
- Stream (type theory)
- Multimap
- Priority queue
- Stack (abstract data type)
- Abstraction (computer science)
- Call stack
- Stack-based memory allocation
- Memory management
- Automatic variable
- Stack buffer overflow
- Stack machine
- Stack overflow
- Stack-oriented programming language
- Generalized algebraic data type
- Initial algebra
- Concept (generic programming)
- Design by contract
- Formal methods
- Functional specification
- Liskov substitution principle
- Object-oriented programming