The Abstract Factory
Conjure families of related objects through higher-order logic interfaces without specifying their concrete theories.
Conjure families of related objects through higher-order logic interfaces without specifying their concrete theories.
Convert the interface of a theory into another interface the clients expect, bridging incompatible realms.
Decouple an abstraction from its implementation so that the two can vary independently across logical dimensions.
Construct complex logical entities step by step, separating the formulation of the spell from its underlying representation.
Avoid coupling the sender of a logical request to its receiver by giving multiple handlers a chance to process it.
Encapsulate a logical request as an object, thereby letting you parameterize clients with different requests.
Compose logical structures into tree structures to represent part-whole hierarchies of enchantments.
Attach additional responsibilities to a theorem or function dynamically without modifying its core truth.
Provide a unified interface to a set of interfaces in a theory, hiding the underlying complexity of the proof system.
Define an interface for creating an artifact, but let subclasses or specific implementations decide which artifact to manifest.
Use sharing to support large numbers of fine-grained logical assertions efficiently.
Given a formal language, define a representation for its grammar along with an interpreter that evaluates it.
Provide a way to access the elements of an aggregate mathematical object sequentially without exposing its underlying representation.
Define an object that encapsulates how a set of logical objects interact.
Without violating encapsulation, capture and externalize an object's internal state so that it can be restored later.
Define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified automatically.
Create new conceptual entities by cloning an existing prototypical entity in Higher-Order Logic.
Provide a surrogate or placeholder for a logical construct to control access or defer its evaluation.
Ensure that a theoretical construct has only one instance, and provide a global point of access to it.
Allow an object to alter its behavior when its internal state changes. The object will appear to change its class.
Define a family of algorithms, encapsulate each one, and make them interchangeable.
Define the skeleton of an algorithm in an operation, deferring some steps to subclasses or providing function parameters.
Represent an operation to be performed on the elements of an object structure.