Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 78

Use this tag if you are implementing a proof engine, proof assistant or something similar in code. Do not use this tag if you are just at the design stage or asking about design decisions of existing code.

7 votes
0 answers
167 views

Tutorial implementations of extensional type theories

There are cool projects out there that covers the basic principles of implementing dependent type theories as very spartan proof assistants. These projects helped a lot when I learned about (implement …
11 votes
1 answer
310 views

Normalization by evaluation for extensional type theories

Is there material on how to implement normalization for (any flavor of) ETT? This describes techniques related to doing untyped normalization. But there are (operational and semantic) problems when tr …
10 votes

What are "fibration/cofibration" in type theory and what are their intuitions?

Let me provide a slightly watered up supplement of Gratzer's answer. In the beginning, mathematicians need to study spaces by considering how other spaces cover(*) them. For example, if you have a lin …
Trebor's user avatar
  • 4,334
18 votes
Accepted

What difficulties are there in basing a proof assistant on the $\lambda\mu$-calculus and has...

TL; DR: There are. But there are also severe difficulties that only have unsatisfactory solutions. Let's see what bad things will happen, so we can attempt to fix it. The first thing when trying to tu …
Trebor's user avatar
  • 4,334