Tags

A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

Use with a computer algebra system (CAS). A CAS solves mathematical problems using symbolic manipulation.
2 questions
Questions about or related to high-performance computing, parallel computing, GPU computing, performance optimization, etc., as they relate to computer-assisted proofs.
2 questions
α-equivalence is used for renaming bound variables.
2 questions
Usually refers to an Agda compiler option which restricts type checking to be compatible with versions of type theory which do not support uniqueness of identity proofs.
2 questions
In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giusepp…
2 questions
Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover that can adequately represent the complex inter-dependencies betwe…
2 questions
Intensional equality usually refers to the equality relation encoded by an equality type in an intensional type theory. Equivalently, you may say it's encoded by an equality type that does not satisfy…
2 questions
2 questions
for J-Bob, a proof assistant from the book "The Little Prover" by Daniel P. Friedman and Carl Eastlund (2015)
2 questions
2 questions
2 questions
For questions about $\mathbb{R}$, the field of real numbers.
2 questions
Questions designed to generate a "big list" of certain results, examples, conjectures, etc. via many individual answers, each contributing one or a few instances. If the question is not objective con…
2 questions
Hereditary substitution is an algorithm that directly computes the canonical result of an ordinary substitution of one canonical form into another. (from Twelf)
2 questions
Questions related to the typesetting system LaTeX and closely related subjects.
2 questions
when asking about proving theorems about or related to combinatorics, or when the question is related to combinatorics in some way,
2 questions
For questions about De Bruijn indices or levels, an encoding method used to efficiently implement variable names with bindings.
2 questions
Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). (from Wikipedia)
2 questions
In constructive mathematics, Markov's principle is the (classically trivial) statement that any infinite sequence of 0 and 1 that is not all 1s must have a 0 somewhere. (from nLab)
2 questions
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. (from Why It’s Nice to be Quoted: Quasiquoting for Haskell)
2 questions
Questions related to Pie, the dependently typed companion language to "The Little Typer"
2 questions
2 questions
An occurrence of a variable in a logic formula which is not inside the scope of a quantifier. (from Wolfram MathWorld).
2 questions
2 questions
In computer science, the syntax of a computer language is the set of rules that defines the combinations of symbols that are considered to be correctly structured statements or expressions in that lan…
2 questions
Bidirectional typing combines two modes of typing: type checking, which checks that a program satisfies a known type, and type synthesis, which determines a type from the program.
2 questions
Use this for questions referencing GitHub repositories when the repository is of value to others on this site.
2 questions
for questions about whether an assertion can be accepted by the proof assistant without adding the axioms. This can be used in situations where it is not desired that the implementation o…
2 questions
Mathematical Components are libraries of formalized mathematics developed using the Coq proof assistant. Use this tag specifically for the analysis component.
1 question
The idea of realizability is a way of making the Brouwer-Heyting-Kolmogorov interpretation of constructivism and intuitionistic mathematics precise. It is related to the propositions as types paradigm…
1 question
for April fools day theorem announcements that are April fools day jokes.
1 question
In mathematics, analysis usually refers to any of a broad family of fields that deals with a general theory of limits in the sense of convergence of sequences (or more generally of nets), particularly…
1 question
The notion of abelian category is an abstraction of basic properties of the category Ab of abelian groups, more generally of the category RMod of modules over some ring, and still more generally of ca…
1 question
In mathematical logic, a witness is a specific value t to be substituted for variable x of an existential statement of the form ∃x φ(x) such that φ(t) is true. (from Wikipedia)
1 question
To discuss questions concerning inductive families. For example, the type of vectors of dimension N can be defined as an inductive family over the natural numbers.
1 question
1
3 4
5
6 7