Lambda cube are replaced by faces, as well as a dual representation as a dodecahedron, where the 12 edges are replaced by faces. Lambda cube In mathematical logic and type theory, the λ-cube is a framework for exploring the axes of refinement in Thierry Coquand's calculus of constructions, starting from the simply typed lambda calculus (written as λ→ in the cube diagram) as the vertex of a cube placed at the origin, and the calculus of constructions (higher-order dependently typed polymorphic lambda calculus; written as λPω in the diagram) as its diametrically opposite vertex. Each axis of the cube represents a new
Folded cube graph Folded cube graph In graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects "opposite" pairs of hypercube vertices. The folded cube graph of order "k" (containing 2 vertices) may be formed by adding edges between opposite pairs of vertices in a hypercube graph of order "k" − 1. (In a hypercube with 2 vertices, a pair of vertices are "opposite" if the shortest path between them has length "n".) It can, equivalently, be formed from a hypercube graph (also) of order "k", which has twice