Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Object (computer science) 434 found (3431 total)

alternate case: object (computer science)

Library (computing) (3,103 words) [view diff] no match in snippet view article

In computer science, a library is a collection of read-only resources that is leveraged during software development to implement a computer program. Historically
Interface (computing) (1,391 words) [view diff] no match in snippet view article
Interoperability Interface Computer bus Hard disk drive interface Implementation (computer science) Implementation inheritance Interoperability Inheritance semantics
Identifier (1,219 words) [view diff] no match in snippet view article find links to article
identity of) either a unique object or a unique class of objects, where the "object" or class may be an idea, physical countable object (or class thereof), or
Software framework (1,440 words) [view diff] no match in snippet view article find links to article
Reusable Object-Oriented Design", Proceedings of the 8th European Conference on Object-Oriented Programming, Lecture Notes in Computer Science, 821, Springer-Verlag:
Procedural programming (985 words) [view diff] no match in snippet view article find links to article
Also classified as imperative, object-oriented programming (OOP) involves dividing a program implementation into objects that expose behavior (methods)
Garbage collection (computer science) (3,962 words) [view diff] no match in snippet view article
In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated
Reference (1,347 words) [view diff] no match in snippet view article find links to article
various other possible combinations. In computer science, references are data types that refer to an object elsewhere in memory and are used to construct
Model (1,544 words) [view diff] no match in snippet view article find links to article
A model is an informative representation of an object, person or system. The term originally denoted the plans of a building in late 16th-century English
Tree (data structure) (2,155 words) [view diff] no match in snippet view article
In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node
Sprite (computer graphics) (2,247 words) [view diff] no match in snippet view article
in a 2D video game. Originally, the term sprite referred to fixed-sized objects composited together, by hardware, with a background. Use of the term has
Coupling (computer programming) (1,831 words) [view diff] no match in snippet view article
{1}{5+2\times 5+5+2\times 5+10+0+3+4}}=0.98} Cohesion (computer science) Connascence (computer science) Coupling (physics) Dead code elimination Dependency
Reflective programming (1,818 words) [view diff] no match in snippet view article find links to article
In computer science, reflective programming or reflection is the ability of a process to examine, introspect, and modify its own structure and behavior
Field (computer science) (674 words) [view diff] no match in snippet view article
In computer science, data that has several parts, known as a record, can be divided into fields (data fields). Relational databases arrange data as sets
Data transfer object (330 words) [view diff] no match in snippet view article find links to article
In the field of programming a data transfer object (DTO) is an object that carries data between processes. The motivation for its use is that communication
Flavors (programming language) (446 words) [view diff] no match in snippet view article
Flavors, an early object-oriented extension to Lisp developed by Howard Cannon at the MIT Artificial Intelligence Laboratory for the Lisp machine and its
Information hiding (1,496 words) [view diff] no match in snippet view article find links to article
In computer science, information hiding is the principle of segregation of the design decisions in a computer program that are most likely to change, thus
Model–view–controller (2,785 words) [view diff] no match in snippet view article find links to article
IEEE Enterprise Distributed Object Computing Conference. pp. 118–127. Wikibooks has a book on the topic of: Computer Science Design Patterns/Model–view–controller
Data access object (539 words) [view diff] no match in snippet view article find links to article
In software, a data access object (DAO) is a pattern that provides an abstract interface to some type of database or other persistence mechanism. By mapping
Concurrency pattern (151 words) [view diff] no match in snippet view article find links to article
patterns include: Active Object Balking pattern Barrier Double-checked locking Guarded suspension Leaders/followers pattern Monitor Object Nuclear reaction Reactor
Node (computer science) (979 words) [view diff] no match in snippet view article
Roselyn (2013). Barron's AP Computer Science A. Barron's. ISBN 978-1-4380-0152-4. "Simply Scheme: Introducing Computer Science ch 18: Trees". College Of
Resource Description Framework (5,039 words) [view diff] no match in snippet view article find links to article
subject, 2) an arc that goes from a subject to an object for the predicate, and 3) a node for the object. Each of the three parts of the statement can be
Active object (535 words) [view diff] no match in snippet view article find links to article
The active object design pattern decouples method execution from method invocation for objects that each reside in their own thread of control. The goal
Identity map pattern (132 words) [view diff] no match in snippet view article find links to article
context-specific, in-memory cache to prevent duplicate retrieval of the same object data from the database. If the requested data has already been loaded from
Monoid (4,447 words) [view diff] no match in snippet view article find links to article
morphisms of an object to itself form a monoid, and, conversely, a monoid may be viewed as a category with a single object. In computer science and computer
Actor model (7,146 words) [view diff] no match in snippet view article find links to article
The actor model in computer science is a mathematical model of concurrent computation that treats an actor as the basic building block of concurrent computation
Identity map pattern (132 words) [view diff] no match in snippet view article find links to article
context-specific, in-memory cache to prevent duplicate retrieval of the same object data from the database. If the requested data has already been loaded from
Interpreter (computing) (4,547 words) [view diff] no match in snippet view article
In computer science, an interpreter is a computer program that directly executes instructions written in a programming or scripting language, without requiring
Domain model (702 words) [view diff] no match in snippet view article find links to article
rules, typically grounded in a description logic. In the field of computer science a conceptual model aims to express the meaning of terms and concepts
Invariant (mathematics) (2,729 words) [view diff] no match in snippet view article
perturbation (for example, if an object is constant on families or invariant under change of metric). In computer science, an invariant is a logical assertion
OOPSLA (154 words) [view diff] no match in snippet view article find links to article
OOPSLA (Object-Oriented Programming, Systems, Languages & Applications) is an annual ACM research conference. OOPSLA mainly takes place in the United States
Active object (535 words) [view diff] no match in snippet view article find links to article
The active object design pattern decouples method execution from method invocation for objects that each reside in their own thread of control. The goal
Unique identifier (710 words) [view diff] no match in snippet view article find links to article
identifiers used for those objects and for a specific purpose. The concept was formalized early in the development of computer science and information systems
Strings (Unix) (293 words) [view diff] no match in snippet view article
regular text files or binary files such as executables. It can be used on object files and core dumps. strings is mainly useful for determining the contents
Callback (computer programming) (1,868 words) [view diff] no match in snippet view article
Jack; Holzman, Albert G; Kent, Allen, eds. (1979). Encyclopedia of Computer Science and Technology: Volume 12. Marcel Dekker, inc. p. 164. ISBN 0-8247-2262-0
BOOPSI (196 words) [view diff] no match in snippet view article find links to article
BOOPSI (Basic Object Oriented Programming System for Intuition) is an object-oriented programming system for AmigaOS. It extends the AmigaOS windowing
Parameter (computer programming) (3,853 words) [view diff] no match in snippet view article
parameters. Unlike argument in usual mathematical usage, the argument in computer science is the actual input expression passed/supplied to a function, procedure
Covariance and contravariance (computer science) (6,691 words) [view diff] no match in snippet view article
parameter and a covariant functor in the second. Polymorphism (computer science) Inheritance (object-oriented programming) Liskov substitution principle This
Delegation (computing) (198 words) [view diff] no match in snippet view article
include: Delegation (object-oriented programming), evaluating a member of one object (the receiver) in the context of another, original object (the sender).
Role-oriented programming (475 words) [view diff] no match in snippet view article find links to article
Oriented Role Analysis Method Object-role modeling Subject (programming) Subject-oriented programming Traits (computer science) Carpenter, Tom (July 18, 2011)
Pipeline (software) (1,359 words) [view diff] no match in snippet view article
are also object pipelines. In an object pipeline, processing elements output objects instead of text. PowerShell includes an internal object pipeline
This (computer programming) (3,125 words) [view diff] no match in snippet view article
are keywords used in some computer programming languages to refer to the object, class, or other entity which the currently running code is a part of. The
Structure (2,140 words) [view diff] no match in snippet view article find links to article
and natural objects such as biological organisms, minerals and chemicals. Abstract structures include data structures in computer science and musical
List of computer scientists (5,134 words) [view diff] no match in snippet view article find links to article
This is a list of computer scientists, people who do work in computer science, in particular researchers and authors. Some persons notable as programmers
Superintelligence (2,947 words) [view diff] no match in snippet view article find links to article
A superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. "Superintelligence"
Value (computer science) (980 words) [view diff] no match in snippet view article
In computer science and software programming, a value is the representation of some entity that can be manipulated by a program. The members of a type
Kolmogorov complexity (7,143 words) [view diff] no match in snippet view article find links to article
algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length
Is-a (1,258 words) [view diff] no match in snippet view article find links to article
In knowledge representation and ontology components, including for object-oriented programming and design, is-a (also written as is_a or is a) is a subsumptive
Inversion of control (1,474 words) [view diff] no match in snippet view article find links to article
Michael (February 1996). "Object-Oriented Frameworks, A survey of methodological issues". Department of Computer Science, Lund University. CiteSeerX 10
History of programming languages (3,584 words) [view diff] no match in snippet view article find links to article
Trabb. "Early development of programming languages". Encyclopedia of Computer Science and Technology. 7. Marcel Dekker: 419–493. Corrado Böhm's PhD thesis
Business object (344 words) [view diff] no match in snippet view article find links to article
A business object is an entity within a multi-tiered software application that works in conjunction with the data access and business logic layers to transport
Dynamic dispatch (2,611 words) [view diff] no match in snippet view article find links to article
In computer science, dynamic dispatch is the process of selecting which implementation of a polymorphic operation (method or function) to call at run time
Offset (computer science) (456 words) [view diff] no match in snippet view article
In computer science, an offset within an array or other data structure object is an integer indicating the distance (displacement) between the beginning
Computer science (7,040 words) [view diff] no match in snippet view article find links to article
Fundamental areas of computer science Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines
Operand (1,151 words) [view diff] no match in snippet view article find links to article
In mathematics, an operand is the object of a mathematical operation, i.e., it is the object or quantity that is operated on. The following arithmetic
Implementation (1,022 words) [view diff] no match in snippet view article find links to article
or the administration or management of a process or objective. In computer science, an implementation is a realization of a technical specification or
PRADO (framework) (390 words) [view diff] no match in snippet view article
interactive web pages and applications. In 2013, it was considered by Computer Science educators to be one of the top six PHP web frameworks. PRADO's name
Ralph Johnson (computer scientist) (190 words) [view diff] no match in snippet view article
Department of Computer Science at the University of Illinois at Urbana-Champaign. He is a co-author of the influential computer science textbook Design
Decomposition (computer science) (467 words) [view diff] no match in snippet view article
Decomposition in computer science, also known as factoring, is breaking a complex problem or system into parts that are easier to conceive, understand
Synchronization (computer science) (2,393 words) [view diff] no match in snippet view article
In computer science, synchronization is the task of coordinating multiple of processes to join up or handshake at a certain point, in order to reach an
Entity component system (1,740 words) [view diff] no match in snippet view article find links to article
with Common Lisp Object System and type system as examples. ECS combines orthogonal, well-established ideas in general computer science and programming
Canonical form (1,873 words) [view diff] no match in snippet view article find links to article
mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical
Synchronization (computer science) (2,393 words) [view diff] no match in snippet view article
In computer science, synchronization is the task of coordinating multiple of processes to join up or handshake at a certain point, in order to reach an
Category theory (3,447 words) [view diff] no match in snippet view article find links to article
areas of computer science also rely on category theory, such as functional programming and semantics. A category is formed by two sorts of objects: the objects
PARC (company) (1,643 words) [view diff] no match in snippet view article
pioneer new technologies in advanced physics, materials science, and computer science applications. In 2002, Xerox spun off Palo Alto Research Center Incorporated
Compiler (7,724 words) [view diff] no match in snippet view article find links to article
system Compile farm List of compilers List of important publications in computer science § Compilers Metacompilation United States Department of Defense (18
Ole-Johan Dahl (885 words) [view diff] no match in snippet view article find links to article
Dahl was a professor of computer science at the University of Oslo and is considered to be one of the fathers of Simula and object-oriented programming along
Extension (semantics) (773 words) [view diff] no match in snippet view article
mathematical object requiring description, the challenge being to find a characterization for which the object becomes the extension. In computer science, some
Reification (computer science) (2,198 words) [view diff] no match in snippet view article
into an explicit data model or other object created in a programming language. A computable/addressable object—a resource—is created in a system as a
ImageNet (1,664 words) [view diff] no match in snippet view article find links to article
in visual object recognition software research. More than 14 million images have been hand-annotated by the project to indicate what objects are pictured
Has-a (713 words) [view diff] no match in snippet view article find links to article
object-oriented programming and design, has-a (has_a or has a) is a composition relationship where one object (often called the constituted object, or
Filter (software) (776 words) [view diff] no match in snippet view article
(Get-ChildItem, ForEach-Object and Sort-Object) are chained with pipes. Get-ChildItem C:\Windows | ForEach-Object { $_.length } | Sort-Object -Ascending McIlroy
Entity (396 words) [view diff] no match in snippet view article find links to article
not be manifest in one or more particular syndromes. In computer science, an entity is an object that has an identity, which is independent of the changes
Bjarne Stroustrup (1,950 words) [view diff] no match in snippet view article find links to article
mathematics with computer science. His interests focused on microprogramming and machine architecture. He learned the fundamentals of object-oriented programming
Barbara Liskov (1,782 words) [view diff] no match in snippet view article find links to article
to object-oriented programming, subtyping, and inheritance. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science
Normal form (abstract rewriting) (1,285 words) [view diff] no match in snippet view article
rewriting, an object is in normal form if it cannot be rewritten any further, i.e. it is irreducible. Depending on the rewriting system, an object may rewrite
Lisp (programming language) (9,664 words) [view diff] no match in snippet view article
of the earliest programming languages, Lisp pioneered many ideas in computer science, including tree data structures, automatic storage management, dynamic
Constant (computer programming) (2,699 words) [view diff] no match in snippet view article
valued) constants, run-time (dynamically valued) constants, immutable objects, and constant types (const). Typical examples of compile-time constants
Inter-process communication (640 words) [view diff] no match in snippet view article find links to article
In computer science, inter-process communication (IPC), also spelled interprocess communication, are the mechanisms provided by an operating system for
Concurrency (computer science) (1,416 words) [view diff] no match in snippet view article
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial
Concatenation (944 words) [view diff] no match in snippet view article find links to article
Fold Map Type systems Dependent types List comprehension Object-oriented programming Object-oriented constructors Operators Ternary conditional operator
Mutator method (2,756 words) [view diff] no match in snippet view article find links to article
In computer science, a mutator method is a method used to control changes to a variable. They are also widely known as setter methods. Often a setter is
Bertrand Meyer (1,102 words) [view diff] no match in snippet view article find links to article
ETH Computer Science department from 2004 to 2006 and for 13 years (2003–2015) taught the Introduction to Programming course taken by all ETH computer science
Type signature (1,305 words) [view diff] no match in snippet view article find links to article
In computer science, a type signature or type annotation defines the inputs and outputs of a function, subroutine or method. A type signature includes
Trait (computer programming) (2,058 words) [view diff] no match in snippet view article
Proceedings of the European Conference on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science. 2743. Springer: 248–274. CiteSeerX 10.1
European Conference on Object-Oriented Programming (187 words) [view diff] no match in snippet view article find links to article
of computer science conferences List of computer science conference acronyms List of publications in computer science Outline of computer science Official
Clone (computing) (1,575 words) [view diff] no match in snippet view article
corruption. In computer programming, particularly object-oriented programming, cloning refers to object copying by a method or copy factory function, often
Assignment (computer science) (3,304 words) [view diff] no match in snippet view article
International(UK). ISBN 0-13-247925-7. Wiener, Richard (1996). An Object-Oriented Introduction to Computer Science Using Eiffel. Upper Saddle River, New Jersey: Prentice
Uninterpreted function (410 words) [view diff] no match in snippet view article find links to article
satisfiability problem for certain other equational theories, see Unification (computer science). As an example of uninterpreted functions for SMT-LIB, if this input
Pool (computer science) (339 words) [view diff] no match in snippet view article
In computer science, a pool is a collection of resources that are kept in memory, ready to use, rather than the memory acquired on use or the memory released
List of important publications in computer science (5,931 words) [view diff] no match in snippet view article find links to article
This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important:
Formal methods (3,624 words) [view diff] no match in snippet view article find links to article
In computer science, formal methods are mathematically rigorous techniques for the specification, development, analysis, and verification of software and
PascalABC.NET (2,424 words) [view diff] no match in snippet view article find links to article
group of enthusiasts at the Institute of Mathematics, Mechanics, and Computer Science in Rostov-on-Don, Russia. In 2003, a predecessor of the modern PascalABC
Precondition (618 words) [view diff] no match in snippet view article find links to article
contract Guard (computer science) Postcondition Hoare logic Invariants maintained by conditions Database trigger Meyer, Bertrand, Object-Oriented Software
Heap (data structure) (2,689 words) [view diff] no match in snippet view article
In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node
Region-based memory management (2,770 words) [view diff] no match in snippet view article find links to article
In computer science, region-based memory management is a type of memory management in which each allocated object is assigned to a region. A region, also
Racket (programming language) (3,207 words) [view diff] no match in snippet view article
development on and with Racket. Racket is also used for scripting, computer science education, and research. The Racket platform provides an implementation
Currying (5,015 words) [view diff] no match in snippet view article find links to article
In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions
Property (disambiguation) (286 words) [view diff] no match in snippet view article
(philosophy), in philosophy and logic, an abstraction characterizing an object Material properties, properties by which the benefits of one material versus
Postcondition (452 words) [view diff] no match in snippet view article find links to article
logic Invariants maintained by conditions Database trigger Meyer, Bertrand, Object-Oriented Software Construction, second edition, Prentice Hall, 1997, p.
Combinatorial optimization (1,882 words) [view diff] no match in snippet view article find links to article
theory, software engineering, VLSI, applied mathematics and theoretical computer science. Some research literature considers discrete optimization to consist
European Conference on Object-Oriented Programming (187 words) [view diff] no match in snippet view article find links to article
of computer science conferences List of computer science conference acronyms List of publications in computer science Outline of computer science Official
Specification pattern (1,804 words) [view diff] no match in snippet view article find links to article
also an implementation of the humble object pattern. public interface ISpecification { bool IsSatisfiedBy(object candidate); ISpecification And(ISpecification
Production system (computer science) (1,660 words) [view diff] no match in snippet view article
<goal>} {(physical-object ^id <O1> ^weight light ^at <p> ^on ceiling) <object-1>} {(physical-object ^id ladder ^at <p> ^on floor) <object-2>} {(monkey ^on
Persistence (computer science) (910 words) [view diff] no match in snippet view article
In computer science, persistence refers to the characteristic of state of a system that outlives (persists more than) the process that created it. This
Upper ontology (5,731 words) [view diff] no match in snippet view article find links to article
used in information science) that consists of very general terms (such as "object", "property", "relation") that are common across all domains. An important
Isotropy (1,245 words) [view diff] no match in snippet view article find links to article
Isotropy group An isotropy group is the group of isomorphisms from any object to itself in a groupoid.[dubious – discuss] An isotropy representation is
Referential transparency (1,468 words) [view diff] no match in snippet view article find links to article
In analytic philosophy and computer science, referential transparency and referential opacity are properties of linguistic constructions, and by extension
Z notation (931 words) [view diff] no match in snippet view article find links to article
(PDF). Engineering Trustworthy Software Systems. Lecture Notes in Computer Science. Vol. 9506. Springer. pp. 103–151. doi:10.1007/978-3-319-29628-9_3
Recursion (3,644 words) [view diff] no match in snippet view article find links to article
that exhibits recursion is recursive. In mathematics and computer science, a class of objects or methods exhibits recursive behavior when it can be defined
Futures and promises (4,616 words) [view diff] no match in snippet view article find links to article
In computer science, future, promise, delay, and deferred refer to constructs used for synchronizing program execution in some concurrent programming languages
M-tree (1,759 words) [view diff] no match in snippet view article find links to article
In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle
Dependency (553 words) [view diff] no match in snippet view article find links to article
depend may refer to: Dependency (computer science) or coupling, a state in which one object uses a function of another object Data dependency, which describes
Data storage (916 words) [view diff] no match in snippet view article find links to article
Software rot In-memory database In-memory processing Persistence (computer science) Persistent data structure RAID Non-RAID drive architectures Memory
Bounded quantification (661 words) [view diff] no match in snippet view article find links to article
Covariance and contravariance (computer science) Curiously recurring template pattern Wildcard (Java) F-bounded polymorphism for object-oriented programming. Canning
COBOL (14,507 words) [view diff] no match in snippet view article find links to article
designed for business use. It is an imperative, procedural and, since 2002, object-oriented language. COBOL is primarily used in business, finance, and administrative
Initialization (programming) (590 words) [view diff] no match in snippet view article
initialization or initialisation is the assignment of an initial value for a data object or variable. The manner in which initialization is performed depends on
Programming language theory (1,616 words) [view diff] no match in snippet view article find links to article
Programming language theory (PLT) is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification
Matthias Felleisen (1,240 words) [view diff] no match in snippet view article find links to article
Matthias Felleisen is a German-American computer science professor and author. He grew up in Germany and immigrated to the US in his twenties. He received
Consensus (computer science) (4,550 words) [view diff] no match in snippet view article
approach is called MSR-type algorithms which have been used widely from computer science to control theory. Bitcoin uses proof of work, a difficulty adjustment
Object Constraint Language (804 words) [view diff] no match in snippet view article find links to article
The Object Constraint Language (OCL) is a declarative language describing rules applying to Unified Modeling Language (UML) models developed at IBM and
Namespace (3,352 words) [view diff] no match in snippet view article find links to article
Authority (IANA) number. A namespace name may provide context (scope in computer science) to a name, and the terms are sometimes used interchangeably. However
Dynamic programming language (1,692 words) [view diff] no match in snippet view article find links to article
In computer science, a dynamic programming language is a class of high-level programming languages which at runtime execute many common programming behaviours
Class variable (460 words) [view diff] no match in snippet view article find links to article
In class-based, object-oriented programming, a class variable is a variable defined in a class of which a single copy exists, regardless of how many instances
Category (mathematics) (2,521 words) [view diff] no match in snippet view article
systems in computer science, such as the semantics of programming languages. Two categories are the same if they have the same collection of objects, the same
Shared memory (1,301 words) [view diff] no match in snippet view article find links to article
In computer science, shared memory is memory that may be simultaneously accessed by multiple programs with an intent to provide communication among them
Optimization problem (672 words) [view diff] no match in snippet view article find links to article
In mathematics, engineering, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions
Knowledge base (1,293 words) [view diff] no match in snippet view article find links to article
In computer science, a knowledge base (KB) is a set of sentences, each sentence given in a knowledge representation language, with interfaces to tell new
Collision (disambiguation) (301 words) [view diff] no match in snippet view article
object Head-on collision, a type of traffic collision Train wreck, a type of disaster involving one or more trains Hash collision, a computer science
Web Ontology Language (4,120 words) [view diff] no match in snippet view article find links to article
representing classes of objects and the verbs representing relations between the objects. Ontologies resemble class hierarchies in object-oriented programming
Static program analysis (1,864 words) [view diff] no match in snippet view article find links to article
In computer science, static program analysis (also known as static analysis or static simulation) is the analysis of computer programs performed without
Global variable (1,299 words) [view diff] no match in snippet view article find links to article
modular programming languages that enforce a module structure, or class-based object-oriented programming languages that enforce a class structure. Interaction
Logo (programming language) (2,458 words) [view diff] no match in snippet view article
and can be used to teach all computer science concepts, as UC Berkeley lecturer Brian Harvey did in his Computer Science Logo Style trilogy. Logo is usually
Carl Hewitt (1,588 words) [view diff] no match in snippet view article find links to article
from the faculty of the MIT Department of Electrical Engineering and Computer Science during the 1999–2000 school year. He became emeritus in the department
Thread-local storage (2,196 words) [view diff] no match in snippet view article find links to article
Thread object stores a (non-thread-safe) map of ThreadLocal objects to their values (as opposed to each ThreadLocal having a map of Thread objects to values
Global variable (1,299 words) [view diff] no match in snippet view article find links to article
modular programming languages that enforce a module structure, or class-based object-oriented programming languages that enforce a class structure. Interaction
Front controller (761 words) [view diff] no match in snippet view article find links to article
to the front controller approach in the MVC model. Design pattern (computer science). Mediator pattern (note: the front controller pattern is a specialized
Carl Hewitt (1,588 words) [view diff] no match in snippet view article find links to article
from the faculty of the MIT Department of Electrical Engineering and Computer Science during the 1999–2000 school year. He became emeritus in the department
Tree structure (968 words) [view diff] no match in snippet view article find links to article
tree structures in specific fields, see Tree (data structure) for computer science; insofar as it relates to graph theory, see tree (graph theory) or
Logo (programming language) (2,458 words) [view diff] no match in snippet view article
and can be used to teach all computer science concepts, as UC Berkeley lecturer Brian Harvey did in his Computer Science Logo Style trilogy. Logo is usually
Brian Harvey (lecturer) (353 words) [view diff] no match in snippet view article
Brian Keith Harvey (born 1949) is a former Lecturer SOE of computer science at University of California, Berkeley. He and his students developed an educational
The Journal of Object Technology (612 words) [view diff] no match in snippet view article find links to article
The Journal of Object Technology is an online scientific journal welcoming manuscripts describing theoretical, empirical, conceptual, and experimental
Douglas C. Schmidt (814 words) [view diff] no match in snippet view article find links to article
programs. In 2003 he became professor of computer Science at Vanderbilt University, and associate chair of computer science and engineering in December 2004.
Turing (programming language) (1,044 words) [view diff] no match in snippet view article
Ontario, Canada. It was designed to help students taking their first computer science course learn how to code. Turing is a descendant of Pascal, Euclid
Timeline of programming languages (229 words) [view diff] no match in snippet view article find links to article
Laboratory 2008 Nim Andreas Rumpf Python, Lisp, Object Pascal 2008 Genie Jamie McCracken Python, Boo, D, Object Pascal 2008 Pure Albert Gräf Q 2009 Chapel
Intuitionistic type theory (4,710 words) [view diff] no match in snippet view article find links to article
Coq'Art: the calculus of inductive constructions. Texts in theoretical computer science. Berlin Heidelberg: Springer. ISBN 978-3-540-20854-9. Clairambault
Relocation (computing) (3,720 words) [view diff] no match in snippet view article
multiprocess systems, and still in many embedded systems, the addresses for objects were absolute starting at a known location, often zero. Since multiprocessing
Generics in Java (2,786 words) [view diff] no match in snippet view article find links to article
to extend Java's type system to allow "a type or method to operate on objects of various types while providing compile-time type safety". The aspect
Comprehension (132 words) [view diff] no match in snippet view article find links to article
an adaptation of mathematical set notation to represent lists in computer science Reading comprehension, a measurement of the understanding of a passage
Manifest typing (346 words) [view diff] no match in snippet view article find links to article
In computer science, manifest typing is explicit identification by the software programmer of the type of each variable being declared. For example: if
Software metric (1,038 words) [view diff] no match in snippet view article find links to article
measurements are essential in all sciences, there is a continuous effort by computer science practitioners and theoreticians to bring similar approaches to software
Adjacency list (1,190 words) [view diff] no match in snippet view article find links to article
In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within
List of computer science conferences (1,322 words) [view diff] no match in snippet view article find links to article
This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are
Oz (programming language) (1,837 words) [view diff] no match in snippet view article
group of Seif Haridi and Peter Van Roy at the Swedish Institute of Computer Science. Since 1999, Oz has been continually developed by an international
Michael Kölling (813 words) [view diff] no match in snippet view article find links to article
1999, he was awarded a Ph.D. in computer science from the University of Sydney, for research on the design of an object-oriented programming environment
System resource (502 words) [view diff] no match in snippet view article find links to article
External devices External memory or objects, such as memory managed in native code, from Java; or objects in the Document Object Model (DOM), from JavaScript
Scope (computer science) (10,578 words) [view diff] no match in snippet view article
my_env$a <- 2 f() ## 1 environment(f) <- my_env f() ## 2 Closure (computer science) Global variable Local variable Let expression Non-local variable Name
Logic in computer science (1,721 words) [view diff] no match in snippet view article find links to article
Logic in computer science covers the overlap between the field of logic and that of computer science. The topic can essentially be divided into three
Index (794 words) [view diff] no match in snippet view article find links to article
Indexicality, in linguistics, the phenomenon of a sign pointing to some object in the context in which it occurs Indexing (motion), in mechanical engineering
Scheme (programming language) (8,204 words) [view diff] no match in snippet view article
programming languages. Scheme was created during the 1970s at the MIT Computer Science and Artificial Intelligence Laboratory (MIT AI Lab) and released by
Kernel (operating system) (10,157 words) [view diff] no match in snippet view article
Research in Operating Systems still Justified?". Lecture Notes In Computer Science; Vol. 563. Proceedings of the International Workshop on Operating Systems
Machine vision (2,852 words) [view diff] no match in snippet view article find links to article
discipline can be considered distinct from computer vision, a form of computer science. It attempts to integrate existing technologies in new ways and apply
Bartok (compiler) (211 words) [view diff] no match in snippet view article
Coetzee (2008). "Type-Preserving Compilation for Large-Scale Optimizing Object-Oriented Compilers" (PDF). Association for Computing Machinery. Tim Harris;
How to Design Programs (754 words) [view diff] no match in snippet view article find links to article
languages. In the 2004 paper, The Structure and Interpretation of the Computer Science Curriculum, the same authors compared and contrasted the pedagogical
Zero-based numbering (2,973 words) [view diff] no match in snippet view article find links to article
though programming languages for mathematics usually index from 1. In computer science, array indices usually start at 0 in modern programming languages,
Queue (abstract data type) (2,083 words) [view diff] no match in snippet view article
In computer science, a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of
Hal Abelson (1,833 words) [view diff] no match in snippet view article find links to article
scientist. He is a professor of computer science and engineering in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute
List of pioneers in computer science (1,515 words) [view diff] no match in snippet view article find links to article
of computing hardware (1960s–present) History of software List of computer science awards List of computer scientists List of Internet pioneers List of
Composition (434 words) [view diff] no match in snippet view article find links to article
Function composition (computer science), an act or mechanism to combine simple functions to build more complicated ones Object composition, combining
Skeleton (computer programming) (2,500 words) [view diff] no match in snippet view article
used in object-oriented programming. In object-oriented programming, dummy code corresponds to an abstract method, a method stub or a mock object. In the
Mutual exclusion (2,336 words) [view diff] no match in snippet view article find links to article
In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions. It is the
Peter Wegner (559 words) [view diff] no match in snippet view article find links to article
a professor of computer science at Brown University from 1969 to 1999. He made significant contributions to both the theory of object-oriented programming
String interning (953 words) [view diff] no match in snippet view article find links to article
In computer science, string interning is a method of storing only one copy of each distinct string value, which must be immutable. Interning strings makes
Bartok (compiler) (211 words) [view diff] no match in snippet view article
Coetzee (2008). "Type-Preserving Compilation for Large-Scale Optimizing Object-Oriented Compilers" (PDF). Association for Computing Machinery. Tim Harris;
Gregor Kiczales (664 words) [view diff] no match in snippet view article find links to article
is an American computer scientist. He is currently a professor of computer science at the University of British Columbia in Vancouver, British Columbia
Terry Halpin (551 words) [view diff] no match in snippet view article find links to article
Queensland at the Key Centre for Software Technology at the Department of Computer Science, which he combined with some work in industry on database modeling
Method stub (330 words) [view diff] no match in snippet view article find links to article
source) return 28 end function In distributed computing, stub is like a mock object – simulates existing code, such as a procedure on a remote machine. Such
Benchmark (computing) (2,569 words) [view diff] no match in snippet view article
or other operations, in order to assess the relative performance of an object, normally by running a number of standard tests and trials against it. The
Eval (2,976 words) [view diff] no match in snippet view article find links to article
a program that interpreted an assignment statement. In theoretical computer science, a careful distinction is commonly made between eval and apply. Eval
Skeleton (computer programming) (2,500 words) [view diff] no match in snippet view article
used in object-oriented programming. In object-oriented programming, dummy code corresponds to an abstract method, a method stub or a mock object. In the
Mediator pattern (1,301 words) [view diff] no match in snippet view article find links to article
software engineering, the mediator pattern defines an object that encapsulates how a set of objects interact. This pattern is considered to be a behavioral
Concept (4,720 words) [view diff] no match in snippet view article find links to article
through concepts. Concepts are regularly formalized in mathematics, computer science, databases and artificial intelligence. Examples of specific high-level
Topology (4,068 words) [view diff] no match in snippet view article find links to article
is the part of mathematics concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting
Abstract rewriting system (2,000 words) [view diff] no match in snippet view article find links to article
In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviated
Non-local variable (412 words) [view diff] no match in snippet view article find links to article
In programming language theory, a non-local variable is a variable that is not defined in the local scope. While the term can refer to global variables
Modeling language (2,852 words) [view diff] no match in snippet view article find links to article
literature. Example of graphical modeling languages in the field of computer science, project management and systems engineering: Behavior Trees are a formal
String interning (953 words) [view diff] no match in snippet view article find links to article
In computer science, string interning is a method of storing only one copy of each distinct string value, which must be immutable. Interning strings makes
Helper class (329 words) [view diff] no match in snippet view article find links to article
In object-oriented programming, a helper class is used to assist in providing some functionality, which isn't the main goal of the application or class
Association Internationale pour les Technologies Objets (99 words) [view diff] no match in snippet view article find links to article
It published The Journal of Object Technology. and is the official sponsor of the annual European Conference on Object-Oriented Programming. "Association
ProgramByDesign (1,789 words) [view diff] no match in snippet view article find links to article
come alive and help inject design knowledge into the introductory computer science curriculum. The effort began using a programming language named PLT
Mechatronics (1,857 words) [view diff] no match in snippet view article find links to article
software engineering, and also includes a combination of robotics, computer science, telecommunications, systems, control, and product engineering. As
Manual memory management (1,417 words) [view diff] no match in snippet view article find links to article
In computer science, manual memory management refers to the usage of manual instructions by the programmer to identify and deallocate unused objects, or
Documentation (1,576 words) [view diff] no match in snippet view article find links to article
is used to describe, explain or instruct regarding some attributes of an object, system or procedure, such as its parts, assembly, installation, maintenance
Mereology (6,944 words) [view diff] no match in snippet view article find links to article
physical objects Topology and mereotopology, especially boundaries, regions, and holes A formal theory of events Theoretical computer science The writings
Comparison of programming languages (strings) (388 words) [view diff] no match in snippet view article
^ String.raw`` still processes string interpolation. 1. ^ https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/raw
CL-HTTP (631 words) [view diff] no match in snippet view article find links to article
on world wide web". Intelligent Tutoring Systems. Lecture Notes in Computer Science. Vol. 1086/1996. Springer. pp. 261–269. doi:10.1007/3-540-61327-7_123
Computation (1,209 words) [view diff] no match in snippet view article find links to article
of computation is the field of computability, itself a sub-field of computer science and mathematical logic. The notion that mathematical statements should
Aggregation (326 words) [view diff] no match in snippet view article find links to article
a type of function in data processing Aggregation, a form of object composition in object-oriented programming Link aggregation, using multiple Ethernet
N-jet (145 words) [view diff] no match in snippet view article find links to article
feature detection, feature classification, stereo matching, tracking and object recognition can be expressed in terms of N-jets computed at one or several
Heap pollution (343 words) [view diff] no match in snippet view article find links to article
Generics". Algebraic Methodology and Software Technology. Lecture Notes in Computer Science. Vol. 5140. pp. 315–329. doi:10.1007/978-3-540-79980-1. ISBN 978-3-540-79979-5
Input/output completion port (215 words) [view diff] no match in snippet view article find links to article
completion port object is created and associated with a number of sockets or file handles. When I/O services are requested on the object, completion is
OCaml (3,909 words) [view diff] no match in snippet view article find links to article
and principally maintained by the French Institute for Research in Computer Science and Automation (Inria). In the early 2000s, elements from OCaml were
Passive data structure (746 words) [view diff] no match in snippet view article find links to article
In computer science and object-oriented programming, a passive data structure (PDS), also termed a plain old data structure or plain old data (POD), is
Comparison of programming languages (string functions) (4,068 words) [view diff] no match in snippet view article
strings directly. In object-oriented languages, string functions are often implemented as properties and methods of string objects. In functional and list-based
Jeff Dean (998 words) [view diff] no match in snippet view article find links to article
from the University of Minnesota in computer science and economics in 1990. He received a Ph.D. in computer science from the University of Washington in
Continuation (3,049 words) [view diff] no match in snippet view article find links to article
In computer science, a continuation is an abstract representation of the control state of a computer program. A continuation implements (reifies) the program
Utility software (1,003 words) [view diff] no match in snippet view article find links to article
Uninstallers. Patching utilities perform alterations of files, especially object programs when program source is unavailable. Screensavers prevent phosphor
Ontology (information science) (6,173 words) [view diff] no match in snippet view article
Knowledge Sharing" by Tom Gruber used ontology as a technical term in computer science closely related to earlier idea of semantic networks and taxonomies
Outline of software engineering (2,090 words) [view diff] no match in snippet view article find links to article
and testing phases. Software tools for engineers use the tenets of computer science; as well as the tenets of calculus, physics, and chemistry. Computer
Abstraction (4,635 words) [view diff] no match in snippet view article find links to article
of similarities between objects, and the process of associating these objects with an abstraction (which is itself an object). For example, picture 1
Logtalk (755 words) [view diff] no match in snippet view article find links to article
for Logtalk Parametric Objects. Applications of Declarative Programming and Knowledge Management. Lecture Notes in Computer Science. Vol. 6547. doi:10
Empty string (671 words) [view diff] no match in snippet view article find links to article
standard) @"" Objective-C (as a constant NSString object) [NSString string] Objective-C (as a new NSString object) q(), qq() Perl str() Python %{} %() Ruby String::new()
Functional programming (8,445 words) [view diff] no match in snippet view article find links to article
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative
Icon (computing) (4,450 words) [view diff] no match in snippet view article
an iconic representation of objects from the 1980s office environment to transpose attributes from a familiar context/object to an unfamiliar one. This
Integrated development environment (2,056 words) [view diff] no match in snippet view article find links to article
modern IDEs also have a class browser, an object browser, and a class hierarchy diagram for use in object-oriented software development. Integrated development
Provenance (7,069 words) [view diff] no match in snippet view article find links to article
is the chronology of the ownership, custody or location of an historical object. The term was originally mostly used in relation to works of art,[citation
Middleware (1,178 words) [view diff] no match in snippet view article find links to article
communications such as a call operation. Object-oriented: Similar to procedural middleware, but incorporates object-oriented programming design principles
Knowledge representation and reasoning (5,022 words) [view diff] no match in snippet view article find links to article
computer science. It refers to the capability of a formalism to have access to information about its own state. An example would be the meta-object protocol
Comparison of programming languages (string functions) (4,068 words) [view diff] no match in snippet view article
strings directly. In object-oriented languages, string functions are often implemented as properties and methods of string objects. In functional and list-based
Polymorphic recursion (735 words) [view diff] no match in snippet view article find links to article
In computer science, polymorphic recursion (also referred to as Milner–Mycroft typability or the Milner–Mycroft calculus) refers to a recursive parametrically
Dead reckoning (3,578 words) [view diff] no match in snippet view article find links to article
reckoning is the process of calculating the current position of a moving object by using a previously determined position, or fix, and incorporating estimates
Fiber (computer science) (605 words) [view diff] no match in snippet view article
In computer science, a fiber is a particularly lightweight thread of execution. Like threads, fibers share address space. However, fibers use cooperative
Divergence (computer science) (439 words) [view diff] no match in snippet view article
In computer science, a computation is said to diverge if it does not terminate or terminates in an exceptional state.: 377  Otherwise it is said to converge
AP Computer Science (480 words) [view diff] no match in snippet view article find links to article
(AP) Computer Science (commonly shortened to AP Comp Sci) is a suite of Advanced Placement courses and examinations covering areas of computer science. They
UCBLogo (1,291 words) [view diff] no match in snippet view article find links to article
used to teach most computer science concepts, as University of California, Berkeley lecturer Brian Harvey did in his Computer Science Logo Style trilogy
Array (data structure) (3,437 words) [view diff] no match in snippet view article
In computer science, an array is a data structure consisting of a collection of elements (values or variables), of same memory size, each identified by
Classification scheme (information science) (640 words) [view diff] no match in snippet view article
representation term. ISO/IEC 11179 Faceted classification Metadata Ontology (computer science) Representation class Representation term Simple Knowledge Organisation
Hierarchy (5,951 words) [view diff] no match in snippet view article find links to article
of fields, such as architecture, philosophy, design, mathematics, computer science, organizational theory, systems theory, systematic biology, and the
Iterator pattern (817 words) [view diff] no match in snippet view article find links to article
ISBN 978-0-321-99278-9. The Wikibook Computer Science Design Patterns has a page on the topic of: Iterator implementations in various languages Object iteration in PHP Iterator
Utility software (1,003 words) [view diff] no match in snippet view article find links to article
Uninstallers. Patching utilities perform alterations of files, especially object programs when program source is unavailable. Screensavers prevent phosphor
Smart pointer (1,847 words) [view diff] no match in snippet view article find links to article
In computer science, a smart pointer is an abstract data type that simulates a pointer while providing added features, such as automatic memory management
Pedro Felipe Felzenszwalb (471 words) [view diff] no match in snippet view article find links to article
School of Engineering and Department of Computer Science at Brown University. Felzenszwalb studied computer science at Cornell University, receiving his
Spaghetti code (1,579 words) [view diff] no match in snippet view article find links to article
exception handling". Lecture Notes in Computer Science. Ada – Europe '93 (Proceedings). Lecture Notes in Computer Science. Vol. 688. Springer Berlin Heidelberg
Lola (computing) (418 words) [view diff] no match in snippet view article
teach digital design on field-programmable gate arrays (FPGAs) to computer science students while a professor at ETH Zurich. The purpose of Lola is to
Exponential decay (2,570 words) [view diff] no match in snippet view article find links to article
simply the lifetime) is the expected value of the amount of time before an object is removed from the assembly. Specifically, if the individual lifetime of
Shannon's source coding theorem (1,881 words) [view diff] no match in snippet view article find links to article
Kolmogorov complexity, which quantifies the minimal description length of an object, is more suitable to describe the limits of data compression. Shannon entropy
Logical framework (965 words) [view diff] no match in snippet view article find links to article
Proof-search in type-theoretic languages:an introduction. Theoretical Computer Science 232 (2000) 5-53. Philippa Gardner. Representing Logics in Type Theory
Ad hoc polymorphism (970 words) [view diff] no match in snippet view article find links to article
differing implementations. Operator overloading Type class Polymorphism (computer science) (other kinds of polymorphism) Parametric polymorphism C. Strachey
Analog image processing (190 words) [view diff] no match in snippet view article find links to article
Wilhelm; Burge, Mark J. (2022). "Digital Image Processing". Texts in Computer Science. doi:10.1007/978-3-031-05744-1. ISSN 1868-0941. Lugt, A.V. (April 1964)
Meronomy (322 words) [view diff] no match in snippet view article find links to article
linguistics and computer science, with applications in biology. The part–whole relationship is sometimes referred to as HAS-A, and corresponds to object composition
Factoring (95 words) [view diff] no match in snippet view article find links to article
whole number into the product of smaller whole numbers Decomposition (computer science) A rule in resolution theorem proving, see Resolution (logic)#Factoring
David Park (computer scientist) (176 words) [view diff] no match in snippet view article
the University of Warwick, he was one of the earliest members of the computer science department, and served as chairperson. McCarthy, J.; Brayton, R.; Edwards
Cohesion (computer science) (1,116 words) [view diff] no match in snippet view article
very good, and functional cohesion is superior. Coupling (computer science) List of object-oriented programming terms Static code analysis Yourdon, Edward;
Shriram Krishnamurthi (341 words) [view diff] no match in snippet view article find links to article
Shriram Krishnamurthi is a computer scientist, currently a professor of computer science at Brown University and a member of the core development group for
Overhead (computing) (766 words) [view diff] no match in snippet view article
In computer science, overhead is any combination of excess or indirect computation time, memory, bandwidth, or other resources that are required to perform
Model–view–viewmodel (1,111 words) [view diff] no match in snippet view article find links to article
to do the binding. Under object-oriented programming, the view model can sometimes be referred to as a data transfer object. Binder Declarative data and
Entity-control-boundary (975 words) [view diff] no match in snippet view article find links to article
pattern used in use-case driven object-oriented programming that structures the classes composing high-level object-oriented source code according to
Compile time (391 words) [view diff] no match in snippet view article find links to article
In computer science, compile time (or compile-time) describes the time window during which a language's statements are converted into binary instructions
Declaration (computer programming) (998 words) [view diff] no match in snippet view article
declaration for that identifier that: for an object [variable or constant], causes storage to be reserved for that object; for a function, includes the function
Object code (361 words) [view diff] no match in snippet view article find links to article
In computing, object code or object module is the product of an assembler or compiler. In a general sense object code is a sequence of statements or instructions
Module (466 words) [view diff] no match in snippet view article find links to article
Modular programming, a software design technique Loadable kernel module, an object file that contains code to extend the running kernel Environment Modules
NeXT Computer (784 words) [view diff] no match in snippet view article find links to article
Cube "NeXT Computer | Science Museum Group Collection". collection.sciencemuseumgroup.org.uk. Retrieved 2024-04-02. "NeXT Computer | Science Museum Group
Graph theory (6,395 words) [view diff] no match in snippet view article find links to article
which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points)
Multiple dispatch (5,881 words) [view diff] no match in snippet view article find links to article
Castagna, Giuseppe (1996). Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science. Birkhäuser. p. 384. ISBN 978-0-8176-3905-1
Distributed shared memory (1,258 words) [view diff] no match in snippet view article find links to article
In computer science, distributed shared memory (DSM) is a form of memory architecture where physically separated memories can be addressed as a single
General-purpose modeling (127 words) [view diff] no match in snippet view article find links to article
general-purpose modeling language to represent the various facets of an object or a system. Examples of GPM languages are: The Unified Modeling Language
Initial algebra (1,140 words) [view diff] no match in snippet view article find links to article
In mathematics, an initial algebra is an initial object in the category of F-algebras for a given endofunctor F. This initiality provides a general framework
Factoring (95 words) [view diff] no match in snippet view article find links to article
whole number into the product of smaller whole numbers Decomposition (computer science) A rule in resolution theorem proving, see Resolution (logic)#Factoring
Data mapper pattern (376 words) [view diff] no match in snippet view article find links to article
interface of an object conforming to this pattern would include functions such as Create, Read, Update, and Delete, that operate on objects that represent
SCM (Scheme implementation) (258 words) [view diff] no match in snippet view article
MIT Computer Science and Artificial Intelligence Laboratory. Massachusetts Institute of Technology. Jaffer, Aubrey. "SCM Mac". MIT Computer Science and
Caml (855 words) [view diff] no match in snippet view article find links to article
Caml was developed in France at French Institute for Research in Computer Science and Automation (INRIA) and École normale supérieure (Paris) (ENS).
Louis Hodes (570 words) [view diff] no match in snippet view article find links to article
recognition Logic programming Scientific career Fields Mathematics Computer science Cancer research Institutions Massachusetts Institute of Technology
Dispatch table (249 words) [view diff] no match in snippet view article find links to article
In computer science, a dispatch table is a table of pointers or memory addresses to functions or methods. Use of such a table is a common technique when
General-purpose modeling (127 words) [view diff] no match in snippet view article find links to article
general-purpose modeling language to represent the various facets of an object or a system. Examples of GPM languages are: The Unified Modeling Language
Ripple effect (628 words) [view diff] no match in snippet view article find links to article
the community to broaden its impact. The concept has been applied in computer science within the field of software metrics as a complexity measure. In October
James Noble (computer scientist) (223 words) [view diff] no match in snippet view article
was the 2016 winner of the Dahl-Nygaard Prize. He was Professor of Computer Science at the Victoria University of Wellington, in Wellington, New Zealand
Docstring (462 words) [view diff] no match in snippet view article find links to article
object at the head of its definition is captured by the addition of docstring syntax in the Python language. The docstring for a Python code object (a
Van Wijngaarden grammar (2,910 words) [view diff] no match in snippet view article find links to article
In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a formalism for defining formal languages. The name derives from the formalism
Semantics (15,015 words) [view diff] no match in snippet view article find links to article
19th century. Semantics is relevant to the fields of formal logic, computer science, and psychology. Semantics is the study of meaning in languages. It
Reference counting (4,775 words) [view diff] no match in snippet view article find links to article
In computer science, reference counting is a programming technique of storing the number of references, pointers, or handles to a resource, such as an
Control flow analysis (265 words) [view diff] no match in snippet view article find links to article
In computer science, control-flow analysis (CFA) is a static-code-analysis technique for determining the control flow of a program. The control flow is
Observer (360 words) [view diff] no match in snippet view article find links to article
to: In information theory, any system which receives information from an object State observer in control theory, a system that models a real system in
Cynthia Solomon (1,063 words) [view diff] no match in snippet view article find links to article
known for her work in popularizing computer science for students. She is a pioneer in the fields of computer science, and educational computing. While
Meronomy (322 words) [view diff] no match in snippet view article find links to article
linguistics and computer science, with applications in biology. The part–whole relationship is sometimes referred to as HAS-A, and corresponds to object composition
Design paradigm (594 words) [view diff] no match in snippet view article find links to article
in traditional fields of design, that it has inspired a branch of computer science, where computational analogies to design paradigms are commonly called
Probabilistic method (1,848 words) [view diff] no match in snippet view article find links to article
analysis, as well as in computer science (e.g. randomized rounding), and information theory. If every object in a collection of objects fails to have a certain
COSFIRE (65 words) [view diff] no match in snippet view article find links to article
This computer science article is a stub. You can help Wikipedia by expanding it.
NeXT Computer (784 words) [view diff] no match in snippet view article find links to article
Cube "NeXT Computer | Science Museum Group Collection". collection.sciencemuseumgroup.org.uk. Retrieved 2024-04-02. "NeXT Computer | Science Museum Group
Distributed shared memory (1,258 words) [view diff] no match in snippet view article find links to article
In computer science, distributed shared memory (DSM) is a form of memory architecture where physically separated memories can be addressed as a single
Seymour Ginsburg (1,435 words) [view diff] no match in snippet view article find links to article
functional dependency, object histories, spreadsheet histories, Datalog, and data restructuring. List of pioneers in computer science Urquhart, Alasdair (2009)
Multiple dispatch (5,881 words) [view diff] no match in snippet view article find links to article
Castagna, Giuseppe (1996). Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science. Birkhäuser. p. 384. ISBN 978-0-8176-3905-1
History of software (3,782 words) [view diff] no match in snippet view article find links to article
curricula in computer science has resulted in improvements in software development. Components of these curricula include: Structured and Object Oriented
James G. Mitchell (698 words) [view diff] no match in snippet view article find links to article
and computer science research by helping the first generation of computer science majors learn to program. He then graduated with a PhD in computer science
Raster Document Object (346 words) [view diff] no match in snippet view article find links to article
The .RDO (Raster Document Object) file format is the native format used by Xerox's DocuTech range of hardware and software, that underpins the company's
Normalization (423 words) [view diff] no match in snippet view article find links to article
property of a rewrite system in mathematical logic and theoretical computer science Normalizing constant, in probability theory a constant to make a non-negative
Motion planning (3,095 words) [view diff] no match in snippet view article find links to article
computational problem to find a sequence of valid configurations that moves the object from the source to destination. The term is used in computational geometry
Concurrency control (2,975 words) [view diff] no match in snippet view article find links to article
In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency
Matrix (mathematics) (13,106 words) [view diff] no match in snippet view article
and columns, which is used to represent a mathematical object or a property of such an object. For example, [ 1 9 − 13 20 5 − 6 ] {\displaystyle
Access control matrix (546 words) [view diff] no match in snippet view article find links to article
In computer science, an access control matrix or access matrix is an abstract, formal security model of protection state in computer systems, that characterizes
Turing Award (3,519 words) [view diff] no match in snippet view article find links to article
technical importance to computer science. It is generally recognized as the highest distinction in the field of computer science and is often referred to
Department of Computer Science, University of British Columbia (663 words) [view diff] no match in snippet view article find links to article
The Department of Computer Science at the University of British Columbia was established in May 1968. UBC CS is located at the UBC Point Grey campus in
Invariant (261 words) [view diff] no match in snippet view article find links to article
free dictionary. Invariant and invariance may refer to: Invariant (computer science), an expression whose value doesn't change during program execution
Alphabet (formal languages) (767 words) [view diff] no match in snippet view article
are used in a diverse range of fields including logic, mathematics, computer science, and linguistics. An alphabet may have any cardinality ("size") and
ABA problem (1,404 words) [view diff] no match in snippet view article find links to article
added to the list, it is common for the allocated object to be at the same location as the deleted object due to MRU memory allocation. A pointer to the
William Wulf (812 words) [view diff] no match in snippet view article find links to article
in 1963. He then achieved the first Doctor of Philosophy (Ph.D.) in computer science from the University of Virginia in 1968. In 1970, while at Carnegie
Information exchange (758 words) [view diff] no match in snippet view article find links to article
refer to bidirectional information transfer in telecommunications and computer science or communication seen from a system-theoretic or information-theoretic
Robert Tarjan (1,467 words) [view diff] no match in snippet view article find links to article
University, he received his master's degree in computer science in 1971 and a Ph.D. in computer science (with a minor in mathematics) in 1972. At Stanford
Capability-based addressing (914 words) [view diff] no match in snippet view article find links to article
In computer science, capability-based addressing is a scheme used by some computers to control access to memory as an efficient implementation of capability-based
Programming language (8,513 words) [view diff] no match in snippet view article find links to article
a performance cost. Programming language theory is the subfield of computer science that studies the design, implementation, analysis, characterization
Gesture recognition (4,120 words) [view diff] no match in snippet view article find links to article
Gesture recognition is an area of research and development in computer science and language technology concerned with the recognition and interpretation
Combinatorics (3,441 words) [view diff] no match in snippet view article find links to article
combinatorial objects. It started as a part of combinatorics and graph theory, but is now viewed as a branch of applied mathematics and computer science, related
Tabula rasa (2,947 words) [view diff] no match in snippet view article find links to article
by a real object, and is, therefore, at the same time conformable to that object; Incomprehensible, which has no relation to any real object, or else,
Zoological Museum Amsterdam (227 words) [view diff] no match in snippet view article find links to article
Netherlands. It was part of the Faculty of Science, Mathematics and Computer Science (Science) of the University of Amsterdam. It was one of the two major
Activity-centered design (212 words) [view diff] no match in snippet view article find links to article
This computer science article is a stub. You can help Wikipedia by expanding it.
R. Kent Dybvig (216 words) [view diff] no match in snippet view article find links to article
R. Kent Dybvig is a professor emeritus of computer science at Indiana University Bloomington, in Bloomington, Indiana. His research focuses on programming
Prolog (7,988 words) [view diff] no match in snippet view article find links to article
Constructing Logic Programs, (Ed. J.M.J. Jacquet). Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence: 27–140. CiteSeerX 10.1
Monad (functional programming) (9,422 words) [view diff] no match in snippet view article
early 1990s established that monads could bring seemingly disparate computer-science problems under a unified, functional model. Category theory also provides
Term algebra (2,175 words) [view diff] no match in snippet view article find links to article
a term algebra is the initial object for the category of all X-generated algebras of the same signature, and this object, unique up to isomorphism, is
JSON-LD (751 words) [view diff] no match in snippet view article find links to article
JSON-LD (JavaScript Object Notation for Linked Data) is a method of encoding linked data using JSON. One goal for JSON-LD was to require as little effort
Artificial imagination (1,257 words) [view diff] no match in snippet view article find links to article
of an object the machine has not encountered. The topic of artificial imagination has garnered interest from scholars outside the computer science domain
Emerald (programming language) (187 words) [view diff] no match in snippet view article
Computer Science at the University of Washington. A simple Emerald program can create an object and move it around the system: const Kilroy ← object Kilroy
Alice (software) (809 words) [view diff] no match in snippet view article
Alice is an object-based educational programming language with an integrated development environment (IDE). Alice uses a drag and drop environment to create
Common Lisp Object System (1,734 words) [view diff] no match in snippet view article find links to article
Common Lisp Object System (CLOS) is the facility for object-oriented programming in ANSI Common Lisp. CLOS is a powerful dynamic object system which
Circuit (598 words) [view diff] no match in snippet view article find links to article
mathematical model for digital logic circuits Integer circuit, a mathematical object of computational complexity Circuit complexity, a branch of computational
Architectural pattern (932 words) [view diff] no match in snippet view article find links to article
of establishing a pattern lexicon, prompting the practitioners of computer science to contemplate their own design lexicon. Usage of this metaphor within
Apache Taverna (1,364 words) [view diff] no match in snippet view article find links to article
run as a W3C PROV-O RDF provenance graph, within a structured Research Object bundle ZIP file that includes inputs, outputs, intermediate values and the
Loose coupling (1,339 words) [view diff] no match in snippet view article find links to article
elements Cascading failure Cohesion (computer science) Connascence (computer programming) Coupling (computer science) Enterprise service bus Application
Baby Modula-3 (413 words) [view diff] no match in snippet view article find links to article
studying computer science type theory. It has been checked as a formal language of metaprogramming systems. It comes from the Scandinavian School of object-oriented
Niklaus Wirth (2,158 words) [view diff] no match in snippet view article find links to article
the Turing Award, generally recognized as the highest distinction in computer science, "for developing a sequence of innovative computer languages". Niklaus
Outline of academic disciplines (4,433 words) [view diff] no match in snippet view article find links to article
computer hardware History of computer science (outline) Humanistic informatics Databases (outline) Distributed databases Object databases Relational databases
EMC Atmos (396 words) [view diff] no match in snippet view article find links to article
The Atmos technology uses an object storage architecture designed to manage petabytes of information and billions of objects across multiple geographic
Prototype (3,678 words) [view diff] no match in snippet view article find links to article
of the derivation 'prototypical'. This is a useful term in identifying objects, behaviours and concepts which are considered the accepted norm and is
MDL (programming language) (682 words) [view diff] no match in snippet view article
MIT-LCS-TR-292" (PDF). Massachusetts Institute of Technology, Laboratory for Computer Science. Retrieved 2019-05-18. Galley, Stu W.; Pfister, Greg (1979). "The MDL
Surfel (136 words) [view diff] no match in snippet view article find links to article
graphics, the use of surfels is an alternative to polygonal modeling. An object is represented by a dense set of points or viewer-facing discs holding lighting
Hash table (5,928 words) [view diff] no match in snippet view article find links to article
Princeton University, Department of Computer Science. Konheim, Alan G. (June 21, 2010). Hashing in Computer Science: Fifty Years of Slicing and Dicing
Software engineering (6,107 words) [view diff] no match in snippet view article find links to article
reliable and works efficiently on real machines"—Fritz Bauer "a branch of computer science that deals with the design, implementation, and maintenance of complex
Amsterdam Compiler Kit (371 words) [view diff] no match in snippet view article find links to article
language using bytecode, called EM. Each language front-end produces EM object files, which are then processed through several generic optimisers before
Builder pattern (726 words) [view diff] no match in snippet view article find links to article
object creation problems in object-oriented programming. The intent of the builder design pattern is to separate the construction of a complex object
Poltergeist (computer programming) (299 words) [view diff] no match in snippet view article
programming, a poltergeist (or gypsy wagon) is a short-lived, typically stateless object used to perform initialization or to invoke methods in another, more permanent
Cloning (programming) (466 words) [view diff] no match in snippet view article
computer science, cloning refers to the making of an exact copy of an object, frequently under the paradigm of instance-based programming, or object-oriented
Mathematical universe hypothesis (2,293 words) [view diff] no match in snippet view article find links to article
universe is a mathematical object in and of itself. Tegmark extends this idea to hypothesize that all mathematical objects exist, which he describes as
Abox (417 words) [view diff] no match in snippet view article find links to article
In computer science, the terms TBox and ABox are used to describe two different types of statements in knowledge bases. TBox statements are the "terminology
Browser Helper Object (896 words) [view diff] no match in snippet view article find links to article
Against Spying with Browser Helper Objects". Intelligence and Security Informatics. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 638–639
Scott Fahlman (646 words) [view diff] no match in snippet view article find links to article
at Carnegie Mellon University's Language Technologies Institute and Computer Science Department. He is notable for early work on automated planning and
AgentSheets (1,498 words) [view diff] no match in snippet view article find links to article
project is to reinvent computer science in public schools by motivating & educating all students to learn about computer science through game design starting
Hiding (106 words) [view diff] no match in snippet view article find links to article
Christoffer Hiding (born 1985), a Swedish singer Information hiding, in computer science, the hiding of design decisions in a computer program Hiding in Plain
Reference (C++) (1,843 words) [view diff] no match in snippet view article
inherited from C. The name C++ reference may cause confusion, as in computer science a reference is a general concept datatype, with pointers and C++ references
Computer graphics (8,762 words) [view diff] no match in snippet view article find links to article
computer graphics hardware. It is a vast and recently developed area of computer science. The phrase was coined in 1960 by computer graphics researchers Verne
Race condition (4,357 words) [view diff] no match in snippet view article find links to article
(logic) Linearizability Racetrack problem Symlink race Synchronization (computer science) Time of check to time of use Test-and-set Huffman, David A. "The synthesis
Skin friction line (209 words) [view diff] no match in snippet view article find links to article
friction arises from the friction of the fluid against the "skin" of the object that is moving through it and forms a vector at each point on the surface
Hexagonal architecture (software) (851 words) [view diff] no match in snippet view article
by Alistair Cockburn in an attempt to avoid known structural pitfalls in object-oriented software design, such as undesired dependencies between layers
Hooking (2,990 words) [view diff] no match in snippet view article find links to article
VirtualProtect(funcptr, sizeof(LPVOID), oldrights, &newrights); } Callback (computer science) Delegation (programming) Terminate-and-stay-resident program User
Proof theory (2,641 words) [view diff] no match in snippet view article find links to article
mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical
Prototype (disambiguation) (474 words) [view diff] no match in snippet view article
software company Prototype-matching, searching for a simplified pattern in objects searched Prototype theory, a model of graded categorization in cognitive
Prototype (disambiguation) (474 words) [view diff] no match in snippet view article
software company Prototype-matching, searching for a simplified pattern in objects searched Prototype theory, a model of graded categorization in cognitive
Shimon Ullman (319 words) [view diff] no match in snippet view article find links to article
including High-level vision: Object recognition and visual cognition. Ullman is the former head of the Department of Computer Science and Applied Mathematics
Mirror (programming) (179 words) [view diff] no match in snippet view article
the object whose structure is being introspected. This is as opposed to traditional reflection, for example in Java, where one introspects an object using
Data modeling (2,809 words) [view diff] no match in snippet view article find links to article
situations. Architectural pattern Comparison of data modeling tools Data (computer science) Data dictionary Document modeling Enterprise data modelling Entity
Carnegie Mellon University (13,468 words) [view diff] no match in snippet view article find links to article
seven colleges, including the College of Engineering, the School of Computer Science, and the Tepper School of Business. The university has its main campus
Tagged architecture (379 words) [view diff] no match in snippet view article find links to article
In computer science, a tagged architecture is a type of computer architecture where every word of memory constitutes a tagged union, being divided into
Poltergeist (computer programming) (299 words) [view diff] no match in snippet view article
programming, a poltergeist (or gypsy wagon) is a short-lived, typically stateless object used to perform initialization or to invoke methods in another, more permanent
Join-pattern (6,482 words) [view diff] no match in snippet view article find links to article
of mobile agents". CONCUR '96: Concurrency Theory. Lecture Notes in Computer Science. Vol. 1119. Le Chesnay: Concurrency Theory. pp. 406–421. doi:10.1007/3-540-61604-7_67
Connascence (760 words) [view diff] no match in snippet view article find links to article
allow reasoning about the complexity caused by dependency relationships in object-oriented design much like coupling did for structured design. In software
Semi-structured model (207 words) [view diff] no match in snippet view article find links to article
efficient because it has to seek around the disk following pointers. The Object Exchange Model (OEM) is one standard to express semi-structured data, another
Seymour Papert (1,828 words) [view diff] no match in snippet view article find links to article
has been used by other researchers in the fields of education and computer science. He influenced the work of Uri Wilensky in the design of NetLogo and
Dialectica space (217 words) [view diff] no match in snippet view article find links to article
de Paiva. "The Dialectica Categories". In Proc. of Categories in Computer Science and Logic, Boulder, CO, 1987. Contemporary Mathematics, vol 92, American
Database connection (654 words) [view diff] no match in snippet view article find links to article
A database connection is a facility in computer science that allows client software to talk to database server software, whether on the same machine or
Forensic software engineering (148 words) [view diff] no match in snippet view article find links to article
software and open-source software Computer science Artificial intelligence Compiler construction Early computer science Operating systems Programming languages
Interceptor pattern (362 words) [view diff] no match in snippet view article find links to article
state. Typical users of this pattern are web-servers (as mentioned above), object- and message-oriented middleware An example of implementation of this pattern
Action at a distance (computer programming) (623 words) [view diff] no match in snippet view article
Action at a distance is an anti-pattern in computer science in which behavior in one part of a program varies wildly based on difficult or impossible to
Apply (1,445 words) [view diff] no match in snippet view article find links to article
Look up apply in Wiktionary, the free dictionary. In mathematics and computer science, apply is a function that applies a function to arguments. It is central
Dahl–Nygaard Prize (438 words) [view diff] no match in snippet view article find links to article
Bertrand Meyer (senior prize) and Gail C. Murphy (junior prize) List of computer science awards "ECOOP 2023 - Awards - ECOOP 2023". ECOOP 2023 Seattle. Retrieved
Cache (computing) (4,303 words) [view diff] no match in snippet view article
connects a local network to one or more cloud storage services, typically object storage services such as Amazon S3. It provides a cache for frequently accessed
Manik Varma (computer scientist) (491 words) [view diff] no match in snippet view article
at Microsoft Research India. He also holds an adjunct professor of computer science position at the Indian Institute of Technology Delhi. He completed
Axiom of pairing (1,147 words) [view diff] no match in snippet view article find links to article
In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo–Fraenkel
ΛProlog (411 words) [view diff] no match in snippet view article find links to article
higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in λProlog
Garth Gibson (215 words) [view diff] no match in snippet view article find links to article
holds a Ph.D. and an MSc in computer science from the University of California, Berkeley, and a B.Math in computer science from the University of Waterloo
Formal language (3,070 words) [view diff] no match in snippet view article find links to article
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed
Expression problem (1,831 words) [view diff] no match in snippet view article find links to article
Object-Oriented Languages (FOOL), REX School/Workshop. Lecture Notes in Computer Science. Vol. 489. Noordwijkerhout, The Netherlands: Springer Berlin Heidelberg
List of open-access journals (807 words) [view diff] no match in snippet view article find links to article
Research Journal of Object Technology Journal of Open Source Software Journal of Statistical Software Logical Methods in Computer Science Semantic Web Theory
Semigroup action (1,971 words) [view diff] no match in snippet view article find links to article
In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation
API (5,575 words) [view diff] no match in snippet view article find links to article
original on 6 May 2021. Retrieved 8 August 2016 – via CMU School of Computer Science. Parnas, D.L. (1972). "On the Criteria To Be Used in Decomposing Systems
Fedora Commons (1,557 words) [view diff] no match in snippet view article find links to article
Libraries, Lecture Notes in Computer Science, Springer, 1998 Kahn, R., Wilensky R., A framework for distributed digital object services, International Journal
International Journal on Artificial Intelligence Tools (115 words) [view diff] no match in snippet view article find links to article
Bioinformatics, Cognitive Informatics, Knowledge-Based/Expert Systems and Object-Oriented Programming for AI. The journal is abstracted and indexed in: Inspec
Sentinel (1,071 words) [view diff] no match in snippet view article find links to article
software project replacing the failed Virtual Case File Sentinel node, an object to represent the end of a data structure Sentinel value, a flag value used
Nominal techniques (114 words) [view diff] no match in snippet view article find links to article
Nominal techniques in computer science are a range of techniques, based on nominal sets, for handling names and binding, e.g. in abstract syntax. Research
Global serializability (996 words) [view diff] no match in snippet view article find links to article
unified schedule of all the individual database (and other transactional object) schedules in a multidatabase environment (e.g., federated database). Complying
Set theory (5,015 words) [view diff] no match in snippet view article find links to article
Likewise, sets and other collection-like objects, such as multisets and lists, are common datatypes in computer science and programming. In addition to that
Topological sorting (3,176 words) [view diff] no match in snippet view article find links to article
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge
Peano axioms (6,324 words) [view diff] no match in snippet view article find links to article
initial object; this initial object is known as a natural number object in C. If (N, 0, S) is this initial object, and (X, 0X, SX) is any other object, then
Syntactic sugar (1,923 words) [view diff] no match in snippet view article find links to article
In computer science, syntactic sugar is syntax within a programming language that is designed to make things easier to read or to express. It makes the
First-class message (231 words) [view diff] no match in snippet view article find links to article
with Feature Constraints". International Journal of Foundations of Computer Science 11:1. François Pottier (2000). "A versatile Constraint-based Type Inference
Specification language (461 words) [view diff] no match in snippet view article find links to article
A specification language is a formal language in computer science used during systems analysis, requirements analysis, and systems design to describe a
Confluence (abstract rewriting) (1,742 words) [view diff] no match in snippet view article
In computer science, confluence is a property of rewriting systems, describing which terms in such a system can be rewritten in more than one way, to yield
Wait-for graph (448 words) [view diff] no match in snippet view article find links to article
graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. In computer science, a system
HOOD method (94 words) [view diff] no match in snippet view article find links to article
HOOD (Hierarchic Object-Oriented Design) is a detailed software design method. It is based on hierarchical decomposition of a software problem. It comprises
Tensor glyph (218 words) [view diff] no match in snippet view article find links to article
In scientific visualization a tensor glyph is an object that can visualize all or most of the nine degrees of freedom, such as acceleration, twist, or
Array programming (2,529 words) [view diff] no match in snippet view article find links to article
In computer science, array programming refers to solutions that allow the application of operations to an entire set of values at once. Such solutions
Le Lisp (308 words) [view diff] no match in snippet view article find links to article
language Lisp. It was developed at the French Institute for Research in Computer Science and Automation (INRIA), to be an implementation language for a very
MindModeling@Home (888 words) [view diff] no match in snippet view article find links to article
2007 Godwin H.J., Walenchok S. et al. Faster than the speed of rejection: Object identification processes during visual search for multiple targets. J Exp
Le Lisp (308 words) [view diff] no match in snippet view article find links to article
language Lisp. It was developed at the French Institute for Research in Computer Science and Automation (INRIA), to be an implementation language for a very
Sentinel (1,071 words) [view diff] no match in snippet view article find links to article
software project replacing the failed Virtual Case File Sentinel node, an object to represent the end of a data structure Sentinel value, a flag value used
Oscar Nierstrasz (655 words) [view diff] no match in snippet view article find links to article
Nierstrasz (born (1957-10-15)October 15, 1957) is a professor at the Computer Science Institute (IAM) at the University of Berne, and a specialist in software
Geographical feature (2,344 words) [view diff] no match in snippet view article find links to article
A feature (also called an object or entity), in the context of geography and geographic information science, is something that exists at a moderate to
Computer file (4,424 words) [view diff] no match in snippet view article find links to article
means a directory can contain an identical name for more than one type of object such as a directory and a file. In environments in which a file is named
Higher-order abstract syntax (1,074 words) [view diff] no match in snippet view article find links to article
In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with
Symbolics (4,003 words) [view diff] no match in snippet view article find links to article
the first commercial object databases, Statice, in 1989. Its developers later went on to found Object Design, Inc. and create ObjectStore. Symbolics introduced
Cluster analysis (8,803 words) [view diff] no match in snippet view article find links to article
Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in
Ordered pair (3,774 words) [view diff] no match in snippet view article find links to article
pairs are also called 2-tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called
Decidability (logic) (1,901 words) [view diff] no match in snippet view article
1017/S0022481200051513. S2CID 798307. Retrieved 5 August 2014. Stack Exchange Computer Science. "Is chess game movement TM decidable?" Undecidable Chess Problem?
Variable (mathematics) (2,883 words) [view diff] no match in snippet view article
Latin variabilis, "changeable") is a symbol that represents a mathematical object. A variable may represent a number, a vector, a matrix, a function, the
Boolean algebra (9,405 words) [view diff] no match in snippet view article find links to article
satisfiability problem (SAT), and is of importance to theoretical computer science, being the first problem shown to be NP-complete. The closely related
Call-with-current-continuation (1,570 words) [view diff] no match in snippet view article find links to article
extent of the call/cc application. In computer science, making this type of implicit program state visible as an object is termed reification. (Scheme does
List of software development philosophies (1,252 words) [view diff] no match in snippet view article find links to article
navigation and information design) The Art of Computer Programming (general computer-science masterpiece by Donald E. Knuth) The Cathedral and the Bazaar - book
ZPL (programming language) (339 words) [view diff] no match in snippet view article
designed and implemented during 1993–1995 by the Orca Project of the Computer Science and Engineering Department at the University of Washington. ZPL uses
Network theory (3,410 words) [view diff] no match in snippet view article find links to article
In mathematics, computer science and network science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges
Inceptionv3 (225 words) [view diff] no match in snippet view article find links to article
v3 is a convolutional neural network for assisting in image analysis and object detection, and got its start as a module for GoogLeNet. It is the third
Software design (2,409 words) [view diff] no match in snippet view article find links to article
is an object-oriented visual Design Description Language and a formal specification language that is suitable primarily for modeling large object-oriented
R-tree (2,902 words) [view diff] no match in snippet view article find links to article
Data". Advances in Spatial and Temporal Databases. Lecture Notes in Computer Science. Vol. 8098. p. 146. doi:10.1007/978-3-642-40235-7_9. ISBN 978-3-642-40234-0
Wildcard (Java) (1,224 words) [view diff] no match in snippet view article
Contravariance) in Java. Bounded quantification Covariance and contravariance (computer science) Generics in Java#Type wildcards section explains lower and upper wildcard
Bigloo (263 words) [view diff] no match in snippet view article find links to article
the French IT research institute French Institute for Research in Computer Science and Automation (INRIA). It is oriented toward providing tools for effective
Pointer swizzling (743 words) [view diff] no match in snippet view article find links to article
In computer science, pointer swizzling is the conversion of references based on name or position into direct pointer references (memory addresses). It
Function composition (computer science) (2,145 words) [view diff] no match in snippet view article
In computer science, function composition is an act or mechanism to combine simple functions to build more complicated ones. Like the usual composition
X-machine (2,547 words) [view diff] no match in snippet view article find links to article
Behavioural Testing of Object-Oriented Systems using CCS-Augmented X-Machines. Tech Report CS-02-06, Dept of Computer Science, University of Sheffield
Bootstrapping (compilers) (1,480 words) [view diff] no match in snippet view article
In computer science, bootstrapping is the technique for producing a self-compiling compiler – that is, a compiler (or assembler) written in the source
Geometric networks (420 words) [view diff] no match in snippet view article find links to article
features. A geometric network is similar to a graph in mathematics and computer science, and can be described and analyzed using theories and concepts similar
International Journal of Software Engineering and Knowledge Engineering (82 words) [view diff] no match in snippet view article find links to article
and the connections between the two disciplines. Topics covered include object-oriented systems, rapid prototyping, logic programming, and software and
Thomas write rule (519 words) [view diff] no match in snippet view article find links to article
In computer science, particularly the field of databases, the Thomas write rule is a rule in timestamp-based concurrency control. It can be summarized
Artifact (error) (654 words) [view diff] no match in snippet view article
information introduced by the involved equipment or technique(s). In computer science, digital artifacts are anomalies introduced into digital signals as
Geometric hashing (1,082 words) [view diff] no match in snippet view article find links to article
In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone
William J. Rapaport (585 words) [view diff] no match in snippet view article find links to article
University at Buffalo Computer Science and Engineering. Retrieved December 7, 2014. William J. Rapaport, "Non-Existent Objects and Epistemological Ontology"
David Luckham (465 words) [view diff] no match in snippet view article find links to article
held faculty and invited faculty positions in both mathematics and computer science at eight major universities in Europe and the United States. He was
Parallel Virtual File System (2,307 words) [view diff] no match in snippet view article find links to article
Research Laboratory at Clemson University and the Mathematics and Computer Science Division at Argonne National Laboratory, and the Ohio Supercomputer
Conditional (computer programming) (3,865 words) [view diff] no match in snippet view article
In computer science, conditionals (that is, conditional statements, conditional expressions and conditional constructs) are programming language commands
Multitier programming (2,772 words) [view diff] no match in snippet view article find links to article
Java Application Partitioning". ECOOP 2002 — Object-Oriented Programming. Lecture Notes in Computer Science. Vol. 2374. pp. 178–204. doi:10.1007/3-540-47993-7_8
Decentralized object location and routing (116 words) [view diff] no match in snippet view article find links to article
In computer science, Decentralized Object Location and Routing (DOLR) is a scalable, location-independent routing technology. It uses location-independent
Transclusion (2,533 words) [view diff] no match in snippet view article find links to article
In computer science, transclusion is the inclusion of part or all of an electronic document into one or more other documents by reference via hypertext
Interning (computer science) (537 words) [view diff] no match in snippet view article
In computer science, interning is re-using objects of equal value on-demand instead of creating new objects. This creational pattern is frequently used
Histogram of oriented gradients (2,863 words) [view diff] no match in snippet view article find links to article
Triggs, researchers for the French National Institute for Research in Computer Science and Automation (INRIA), presented their supplementary work on HOG descriptors
Karl Lieberherr (246 words) [view diff] no match in snippet view article find links to article
Karl J. Lieberherr is a professor of Computer Science at Northeastern University, in Boston. He did his studies at ETH Zurich, obtaining an M.S. in 1973
Event calculus (3,162 words) [view diff] no match in snippet view article find links to article
Beyond: Essays in Honour of Robert A. Kowalski Part II, Lecture Notes in Computer Science, Berlin, Heidelberg: Springer, pp. 452–490, doi:10.1007/3-540-45632-5_17
Network tomography (603 words) [view diff] no match in snippet view article find links to article
slicing). The field is a recent development in electrical engineering and computer science, dating from 1996. Network tomography seeks to map the path data takes
Iterated function (4,330 words) [view diff] no match in snippet view article find links to article
L=F(K),\ M=F\circ F(K)=F^{2}(K).} Iterated functions are studied in computer science, fractals, dynamical systems, mathematics and renormalization group
L-value (98 words) [view diff] no match in snippet view article find links to article
brightness of a lunar eclipse on the Danjon scale L-value (computer science), denoting an object to which values can be assigned In number theory, the value
Joyce Farrell (531 words) [view diff] no match in snippet view article find links to article
ISBN 1-4239-0128-2. Object-Oriented Programming Using C++, 4th Edition, ISBN 1-4239-0257-2. (found in 221 libraries, counting all editions Object-Oriented Programming