User Rafael Castro

22 votes

1 answer

2k views

Is possible to prove undecidability of the halting problem in Coq?

asked Aug 29, 2017 at 13:36

8 votes

5 answers

2k views

Relationship between formal system and formal languages

asked May 11, 2015 at 22:26

8 votes

1 answer

290 views

Relation between Type Assignment system (TA) and Hindley-Milner system

asked Sep 28, 2016 at 14:45

6 votes

0 answers

503 views

How are observational equivalence, contextual equivalence, and extensional equality related?

asked May 24, 2017 at 19:19

4 votes

1 answer

345 views

Typing rule for binding groups

asked Jan 8, 2019 at 0:56

3 votes

1 answer

747 views

The law of excluded middle and decidability

asked Jul 3, 2019 at 23:29

2 votes

0 answers

155 views

Proving that the failure of algorithm W implies that the program is not typable

asked Jun 29, 2019 at 19:26

2 votes

1 answer

191 views

Construct a proof tree in Hindley-Milner with function overload

asked Mar 26, 2017 at 23:47

1 vote

1 answer

267 views

Comparison Procedure in Robinson's Unification Algorithm

asked Jan 23, 2017 at 16:58

1 vote

1 answer

2k views

Proof that L(M) = {accepts the string 1100 } is undecidable

asked Oct 19, 2014 at 20:24

1 vote

2 answers

334 views

Trying to understand the proof of the halting problem presented in Sipser textbook

asked Apr 11, 2015 at 23:10

1 vote

1 answer

91 views

Distributed predicate computation on event stream

asked Aug 4, 2020 at 23:53

0 votes

1 answer

112 views

If the language $A$ is decidable and the language $B$ is recognizable, then the language $A \cap B$ is recognizable?

asked Apr 17, 2015 at 0:13

Stack Exchange Network

13 Questions

Is possible to prove undecidability of the halting problem in Coq?

Relationship between formal system and formal languages

Relation between Type Assignment system (TA) and Hindley-Milner system

How are observational equivalence, contextual equivalence, and extensional equality related?

Typing rule for binding groups

The law of excluded middle and decidability

Proving that the failure of algorithm W implies that the program is not typable

Construct a proof tree in Hindley-Milner with function overload

Comparison Procedure in Robinson's Unification Algorithm

Proof that L(M) = {accepts the string 1100 } is undecidable

Trying to understand the proof of the halting problem presented in Sipser textbook

Distributed predicate computation on event stream

If the language $A$ is decidable and the language $B$ is recognizable, then the language $A \cap B$ is recognizable?