object MRealizability
- Source
- m-realizability.scala
- Alphabetic
- By Inheritance
- MRealizability
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
flat(formula: Formula)(implicit systemT: Context): Ty
computes the type of a potential m-realizer for the formula
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mrealize(proof: NDProof, re: Boolean = true)(implicit ctx: Context): (Map[SequentIndex, Var], Expr)
Extracts an mrealizer for a theorem from its proof.
Extracts an mrealizer for a theorem from its proof.
- proof
proof from which the realizer is extracted
- re
boolean whether or not the result should be normalized with respect to the empty program (default) or not
- ctx
system T
- returns
a term M of system T, and a map of sequentindices of the antecedent of the conclusion of the proof, to variables x1,...,xk, such that: if M1,...,Mk are m-realizers for the formulas in the antecedent, then M[M1/x1]...[Mk/xk] m-realizes the succedent of the conclusion
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
recursor(indType: TBase, resultType: Ty)(implicit ctx: Context): Const
Gives a recursor constant for an inductive type.
Gives a recursor constant for an inductive type.
- indType
the inductive type that the recursor is for
- resultType
type of the result of applying terms to the recursor
- ctx
context that the inductive type is defined in
- returns
recursor constant
-
def
remEmpProg(term: Expr)(implicit systemT: Context): Expr
removes all occurences of the empty program i : 1 from term, or is i : 1 itself, except for match and inl and inr term: sometimes not possible to remove all occurences.
-
def
remEmpProgType(typee: Ty)(implicit systemT: Context): Ty
removes all occurences of the empty program type 1 from term, or is 1 itself, except for the sum type.
- def remEmpProgTypes(types: List[Ty])(implicit systemT: Context): List[Ty]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
systemT(ctx: Context): Context
Transforms a context into system T.
Transforms a context into system T.
- ctx
original context
- returns
original context with recursors for inductive types, pair and sum types and terms, and the empty program
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
This is the API documentation for GAPT.
The main package is gapt.