榜单
服务器优惠
AI论文
-
Two-Level Type Theory
Two-Level Type Theory Basics Two-Level Type Theory Basics Two-level type theory (2LTT) refers to versions of Martin-Löf type theory that combine two type theories: one “inner”... -
Termination Checking
Termination Checking Primitive recursion Structural recursion With-functions Pragmas and Options References Termination Checking Not all recursive functions are permitted -... -
Automatic Proof Search (Auto)
Automatic Proof Search (Auto) Usage Case split Equality reasoning Hints Timeout Listing and choosing among several solutions Disproving Auto refine / suggest Dependencies be... -
Irrelevance
Irrelevance Motivating example Irrelevant function types What can be done to irrelevant arguments What can’t be done to irrelevant arguments Irrelevant declarations Irrelevant... -
Two-Level Type Theory
Two-Level Type Theory Basics Two-Level Type Theory Basics Two-level type theory (2LTT) refers to versions of Martin-Löf type theory that combine two type theories: one “inner”... -
Coinduction
Coinduction Coinductive Records Coinductive Record Constructors The ETA pragma Old Coinduction Coinduction The corecursive definitions below are accepted if the option --gu... -
Guarded Type Theory
Guarded Type Theory References Guarded Type Theory Note This is a stub. Option --guarded extends Agda with Nakano’s later modality and guarded recursion based on Ticked (Cub... -
Guarded Type Theory
Guarded Type Theory References Guarded Type Theory Note This is a stub. Option --guarded extends Agda with Nakano’s later modality and guarded recursion based on Ticked (Cub... -
Two-Level Type Theory
Two-Level Type Theory Basics Two-Level Type Theory Basics Two-level type theory (2LTT) refers to versions of Martin-Löf type theory that combine two type theories: one “inner”... -
Termination Checking
Termination Checking Primitive recursion Structural recursion With-functions Pragmas and Options References Termination Checking Not all recursive functions are permitted -...